Sciweavers

COMPGEOM
2004
ACM
14 years 5 months ago
A computational framework for incremental motion
We propose a generic computational framework for maintaining a discrete geometric structure defined by a collection of static and mobile objects. We assume that the mobile object...
David M. Mount, Nathan S. Netanyahu, Christine D. ...
COMPGEOM
2004
ACM
14 years 5 months ago
New results on shortest paths in three dimensions
We revisit the problem of computing shortest obstacle-avoiding paths among obstacles in three dimensions. We prove new hardness results, showing, e.g., that computing Euclidean sh...
Joseph S. B. Mitchell, Micha Sharir
COMPGEOM
2004
ACM
14 years 5 months ago
Approximate convex decomposition
Jyh-Ming Lien, Nancy M. Amato
COMPGEOM
2004
ACM
14 years 5 months ago
Approximate convex decomposition of polygons
We propose a strategy to decompose a polygon, containing zero or more holes, into “approximately convex” pieces. For many applications, the approximately convex components of ...
Jyh-Ming Lien, Nancy M. Amato
COMPGEOM
2004
ACM
14 years 5 months ago
Binary space partitions of orthogonal subdivisions
We consider the problem of constructing binary space partitions (BSPs) for orthogonal subdivisions (space filling packings of boxes) in d-space. We show that a subdivision with n...
John Hershberger, Subhash Suri, Csaba D. Tó...
COMPGEOM
2004
ACM
14 years 5 months ago
The corner arc algorithm
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algor...
Olaf A. Hall-Holt
COMPGEOM
2004
ACM
14 years 5 months ago
An empirical comparison of techniques for updating Delaunay triangulations
The computation of Delaunay triangulations from static point sets has been extensively studied in computational geometry. When the points move with known trajectories, kinetic dat...
Leonidas J. Guibas, Daniel Russel
COMPGEOM
2004
ACM
14 years 5 months ago
A scalable simulator for forest dynamics
Models of forest ecosystems are needed to understand how climate and land-use change can impact biodiversity. In this paper we describe an individual-based, spatially-explicit for...
Sathish Govindarajan, Mike Dietze, Pankaj K. Agarw...
COMPGEOM
2004
ACM
14 years 5 months ago
Deformable spanners and applications
For a set S of points in Rd, an s-spanner is a graph on S such that any pair of points is connected via some path in the spanner whose total length is at most s times the Euclidea...
Jie Gao, Leonidas J. Guibas, An Nguyen
COMPGEOM
2004
ACM
14 years 5 months ago
Searching with an autonomous robot
We discuss online strategies for visibility-based searching for an object hidden behind a corner, using Kurt3D, a real autonomous mobile robot. This task is closely related to a n...
Sándor P. Fekete, Rolf Klein, Andreas N&uum...