947 search results - page 85 / 190 » Discrete Geometry |
COMPGEOM
1997
ACM
15 years 2 months ago
1997
ACM
Within industrial contexts, a common view of the level of confidence needed in CAD data transfer processes may be expressed as “1 don’t mind if the [CAD data- tmnsfer] algorit...
COMPGEOM
1996
ACM
15 years 2 months ago
1996
ACM
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, are publicly available. Their inputs are ordinary single or double precision flo...
COMPGEOM
1993
ACM
15 years 1 months ago
1993
ACM
We consider graphs such as the minimum spanning tree, minimum Steiner tree, minimum matching, and traveling salesman tour for n points in the d-dimensional unit cube. For each of ...
COMPGEOM
1994
ACM
15 years 1 months ago
1994
ACM
For two given point sets, we present a very simple (almost trivial) algorithm to translate one set so that the Hausdor distance between the two sets is not larger than a constant ...
COMPGEOM
1990
ACM
15 years 1 months ago
1990
ACM
Given a set of nonintersecting polygonal obstacles in the plane, the link distance between two points s and t is the minimum number of edges required to form a polygonal path conn...