Sciweavers

Share
warning: Creating default object from empty value in /var/www/modules/taxonomy/taxonomy.module on line 1416.
COMPGEOM
1994
ACM
12 years 1 months ago
Spheres, Molecules, and Hidden Surface Removal
We devise techniques to manipulate a collection of loosely interpenetrating spheres in threedimensional space. Our study is motivated by the representation and manipulation of mol...
Dan Halperin, Mark H. Overmars
COMPGEOM
1994
ACM
12 years 2 months ago
Interactive Visualization of Weighted Three-Dimensional Alpha Hulls
An interactive visualization of weighted three-dimensional -hulls is presented for static and dynamic spheres. The -hull is analytically computed and represented by a triangulated...
Amitabh Varshney, Frederick P. Brooks Jr., William...
COMPGEOM
1994
ACM
12 years 2 months ago
Query-Sensitive Ray Shooting
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...
Joseph S. B. Mitchell, David M. Mount, Subhash Sur...
COMPGEOM
1994
ACM
12 years 2 months ago
Almost Tight Upper Bounds for the Single Cell and Zone Problems in Three Dimensions
We consider the problem of bounding the combinatorial complexity of a single cell in an arrangement of n low-degree algebraic surface patches in 3-space. We show that this complex...
Dan Halperin, Micha Sharir
COMPGEOM
1994
ACM
12 years 2 months ago
Triangulating Topological Spaces
Herbert Edelsbrunner, Nimish R. Shah
COMPGEOM
1994
ACM
12 years 2 months ago
Competitive Searching in a Generalized Street
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...
Amitava Datta, Christian Icking
COMPGEOM
1994
ACM
12 years 2 months ago
Matching Shapes with a Reference Point
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 ...
Helmut Alt, Oswin Aichholzer, Günter Rote
COMPGEOM
1994
ACM
12 years 2 months ago
Computing Many Faces in Arrangements of Lines and Segments
We present randomized algorithms for computing many faces in an arrangement of lines or of segments in the plane, which are considerably simpler and slightly faster than the previo...
Pankaj K. Agarwal, Jirí Matousek, Otfried S...
COMPGEOM
1994
ACM
12 years 2 months ago
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
Pankaj K. Agarwal, Mark de Berg, Jirí Matou...
COMPGEOM
1994
ACM
12 years 2 months ago
Computing Envelopes in Four Dimensions with Applications
Let F be a collection of n d-variate, possibly partially defined, functions, all algebraic of some constant maximum degree. We present a randomized algorithm that computes the vert...
Pankaj K. Agarwal, Boris Aronov, Micha Sharir
books