2093 search results - page 159 / 419 » Statistical Point Geometry |
127
Voted
COMPGEOM
1998
ACM
15 years 8 months ago
1998
ACM
An algorithm and a robust floating point implementation is given for rotational polygon containment: given polygons P1,P2,P3,...,Pk and a container polygon C, find rotations and...
161
Voted
COMPGEOM
1996
ACM
15 years 8 months ago
1996
ACM
In this paper we are concerned with developing a practical parallel algorithm for Delaunay triangulation that works well on general distributions, particularly those that arise in...
132
Voted
COMPGEOM
1994
ACM
15 years 7 months ago
1994
ACM
We consider the problem of a robot which has to find a target in an unknown simple polygon, based only on what it has seen so far. A street is a polygon for which the two boundary...
123
Voted
COMPGEOM
1987
ACM
15 years 7 months ago
1987
ACM
We are interested in Voronoi diagrams as a tool in robot path planning, where the search for a path in an r-dimensional space may be simplified to a search on an (r- l)-dimensional...
117
click to vote
COMPGEOM
2005
ACM
15 years 5 months ago
2005
ACM
We consider the problem of discovering a smooth unknown surface S bounding an object O in R3 . The discovery process consists of moving a point probing device in the free space ar...