Related papers: Computational Geometry Column 37
Defined mathematically as critical points of surface area subject to a volume constraint, constant mean curvatures (CMC) surfaces are idealizations of interfaces occurring between two immiscible fluids. Their behavior elucidates phenomena…
This volume contains the post-proceedings of the Fourteenth and the Fifteenth International Workshops on Graph Computation Models (GCM 2023 and 2024). The workshops took place in Leicester, UK on 18th July 2023 and Enschede, the Netherlands…
In this survey I should like to introduce some concepts of algebraic geometry and try to demonstrate the fruitful interaction between algebraic geometry and computer algebra and, more generally, between mathematics and computer science. One…
We consider some simple examples of supersymmetric quantum mechanical systems and explore their possible geometric interpretation with the help of geometric aspects of real Clifford algebras. This leads to natural extensions of the…
This note completes a talk given at the conference Curves over Finite Fields: past, present and future celebrating the publication the book {\em Rational Points on Curves over Finite Fields by J.-P. Serre and organised at Centro de ciencias…
This volume contains the proceedings of the 7th International Workshop on Developments in Computational Models (DCM 2011) which was held on Sunday July 3, 2011, in Zurich, Switzerland, as a satelite workshop of ICALP 2011. Recently several…
In this survey article, we present interactions between algebraic geometry and computer vision, which have recently come under the header of algebraic vision. The subject has given new insights in multiple view geometry and its application…
We introduce a new formalism and a number of new results in the context of geometric computational vision. The classical scope of the research in geometric computer vision is essentially limited to static configurations of points and lines…
We present an algorithm for computing curves and families of curves of prescribed degree and geometric genus on real rational surfaces.
Traditionally, computation within self-assembly models is hard to conceal because the self-assembly process generates a crystalline assembly whose computational history is inherently part of the structure itself. With no way to remove…
This volume contains the proceedings of the (first) Graphs as Models (GaM) 2015 workshop, held on 10-11 April 2015 in London, U.K., as a satellite workshop of ETAPS 2015, the European Joint Conferences on Theory and Practice of Software.…
This article presents a general solution to the problem of computational complexity. First, it gives a historical introduction to the problem since the revival of the foundational problems of mathematics at the end of the 19th century.…
The simplex method in Linear Programming motivates several problems of asymptotic convex geometry. We discuss some conjectures and known results in two related directions -- computing the size of projections of high dimensional polytopes…
The identification of the interfacial molecules in fluid-fluid equilibrium is a long-standing problem in the area of simulation. We here propose a new point of view, making use of concepts taken from the field of computational geometry,…
Here practical aspects of conducting research via computer simulations are discussed. The following issues are addressed: software engineering, object-oriented software development, programming style, macros, make files, scripts, libraries,…
We extend the Theory of Computation on real numbers, continuous real functions, and bounded closed Euclidean subsets, to compact metric spaces $(X,d)$: thereby generically including computational and optimization problems over higher types,…
Diagram semigroups are interesting algebraic and combinatorial objects, several types of them originating from questions in computer science and in physics. Here we describe diagram semigroups in a general framework and extend our…
This is a slightly edited version of the transparencies for a seminar at UCL, May 7, 2003. It is intended to give a quick view of background, ideas, and some calculations, in the applicatioon of some non commutative methods to algebraic…
The convex feasibility problem (CFP) is to find a feasible point in the intersection of finitely many convex and closed sets. If the intersection is empty then the CFP is inconsistent and a feasible point does not exist. However,…
Projective geometry provides the preferred framework for most implementations of Euclidean space in graphics applications. Translations and rotations are both linear transformations in projective geometry, which helps when it comes to…