Browsing European Workshop on Computational Geometry (20th. 2004. Sevilla) by Title
Now showing items 49-56 of 56
-
Presentation
The minimum Manhattan network problem approximations and exact solutions
(2004)A Manhattan p–q path is a geodesic in the Manhattan (or L1-) metric that connects p and q, i.e. a staircase path between ...
-
Presentation
The siphon problem
(2004)An α-siphon is the locus of points in the plane that are at the same distance ǫ from a polygonal chain consisting of two ...
-
Presentation
Triangulations without pointed spanning trees
(2004)Problem 50 in the Open Problems Project asks whether any triangulation on a point set in the plane contains a pointed ...
- Presentation
-
Presentation
Unfolding simple chains inside circles
(2004)It is an open problem to determined whether a polygonal chain can be straightened inside a confi ning region if its links ...
- Presentation
-
Presentation
Verification of partitions of 2d and 3d objects
(2004)We consider the problems of deciding whether a given collection of polygons (polyhedra resp.) forms (i) a partition or ...
- Presentation