947 search results - page 82 / 190 » Discrete Geometry |
JCDCG
2004
Springer
15 years 3 months ago
2004
Springer
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
101
click to vote
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
The algorithms for computing a shortest path on a polyhedral surface are slow, complicated, and numerically unstable. We have developed and implemented a robust and efficient algo...
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
In this paper we describe and discuss a new kernel design for geometric computation in the plane. It combines different kinds of floating-point filter techniques and a lazy eval...
COMPGEOM
2000
ACM
15 years 2 months ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
COMPGEOM
1999
ACM
15 years 2 months ago
1999
ACM
We wish to extract the topology from scanned maps. In previous work [15] this was done by extracting a skeleton from the Voronoi diagram, but this required vertex labelling and wa...