- Full text PDF available (11)
- This year (0)
- Last five years (2)
We study problems that arise in the context of covering certain geometric objects (so-called seeds, e.g., points or disks) by a set of other geometric objects (a so-called cover, e.g., a set of disks or homo-thetic triangles). We insist that the interiors of the seeds and the cover elements are pairwise disjoint, but they can touch. We call the contact… (More)
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 suuciently large and equal number of vertices.
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)
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 study the relationship between some alternative deenitions of the concept of the width of a convex set on the sphere. Those relations allow to characterize whether a convex set on the sphere can pass through a spherical interval by rigid motions. Finally, we give an optimal algorithm to compute the width on the sphere.