20 search results - page 3 / 4 » compgeom 2000 |
COMPGEOM
2000
ACM
13 years 9 months ago
2000
ACM
It has been known for 30 years that pseudorandom number generators in the class of linear congruential generators (LCG) exhibit strong and predictable regularities. A widely used ...
COMPGEOM
2000
ACM
13 years 9 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
2000
ACM
13 years 9 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
13 years 9 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
13 years 8 months ago
2000
ACM
The purpose of this paper is to present a new method to design exact geometric predicates in algorithms dealing with curved objects such as circular arcs. We focus on the comparis...