4047 search results - page 343 / 810 » The Discrete Basis Problem |
138
Voted
COMPGEOM
1998
ACM
15 years 9 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...
132
click to vote
COMPGEOM
1997
ACM
15 years 9 months ago
1997
ACM
We describe the first known algorithm for efficiently maintaining a Binary Space Partition (BSP) for n continuously moving segments in the plane, whose interiors remain disjoint...
150
click to vote
COMPGEOM
1997
ACM
15 years 9 months ago
1997
ACM
Abstract. In the context of methodologies intended to confer robustness to geometric algorithms, we elaborate on the exact-computation paradigm and formalize the notion of degree o...
141
click to vote
COMPGEOM
1994
ACM
15 years 9 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...
134
Voted
COMPGEOM
1994
ACM
15 years 9 months ago
1994
ACM
Ray (segment) shooting is the problem of determining the first intersection between a ray (directed line segment) and a collection of polygonal or polyhedral obstacles. In order t...