- Full text PDF available (16)
- This year (0)
- Last 5 years (2)
- Last 10 years (10)
Journals and Conferences
We show that any two outer-triangulations on the same closed surface can be transformed into each other by a sequence of diagonal ips, up to isotopy, if they have a su6ciently large and equal number of vertices. c © 2002 Elsevier Science B.V. All rights reserved.
The problem of computing a representation of the stabbing lines of a set S of segments in the plane was solved by Edelsbrunner et al. We provide efficient algorithms for the following problems: computing the stabbing wedges for S, finding a stabbing wedge for a set of parallel segments with equal length, and computing other stabbers for S such as a… (More)
The dilation-free graph of a planar point set S is a graph that spans S in such a way that the distance between two points in the graph is no longer than their planar distance. Metrically speaking, those graphs are equivalent to complete graphs; however they have far fewer edges when considering the Manhattan distance (we give here an upper bound on the… (More)
Motion planning and visibility problems are some of the most important topics studied in Computer Graphics, Computational Geometry and Robotics. There exits several and important results to these problems. We propose a new approach in this paper using a preprocessing in the plane, the polar diagram. The polar diagram can be considered as a plane… (More)
We show that many classical problems of Computational Geometry can be solved in the cylinder, but planar techniques cannot be adapted always successfully and new techniques must be considered.
We consider whether any two triangulations of a polygon or a point set on a nonplanar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some remarkable exceptions, such as polygons on the cylinder, and on the flat torus, and certain configurations of points on the cylinder.
We consider whether any two triangulations of a polygon on a non-planar surface with a given metric can be transformed into each other by a sequence of edge flips. The answer is negative in general with some remarkable exceptions, such as the cylinder and the flat torus.