COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
A thrackle is a graph drawn in the plane so that its edges are represented by Jordan arcs and any two distinct arcs either meet at exactly one common vertex or cross at exactly on...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
We outline an algorithm and implementation of a system that computes Boolean combinations of sculptured solids. We represent the surface of the solids in terms of trimmed and untr...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
We present a competitive strategy for walking into the kernel of an initially unknown star-shaped polygon. From an arbitrary start point, s, within the polygon, our strategy find...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
A convex polytope P can be speci ed in two ways: as the convex hull of the vertex set V of P, or as the intersection of the set H of its facet-inducing halfspaces. The vertex enum...
COMPGEOM
1995
ACM
13 years 11 months ago
1995
ACM
The range searching problem is a fundamental problem in computational geometry, with numerous important applications. Most research has focused on solving this problem exactly, bu...