Sciweavers

CCCG
2004
13 years 11 months ago
On multi-level k-ranges for range search
Sean M. Falconer, Bradford G. Nickerson
CCCG
2004
13 years 11 months ago
Computing the set of all distant horizons of a terrain
We study the problem of computing the set of all distant horizons of a terrain, represented as either: the set of all edges that appear in the set of all distant horizons; the con...
William S. Evans, Daniel Archambault, David G. Kir...
CCCG
2004
13 years 11 months ago
On corners of objects built from parallelepiped bricks
We investigate a question initiated in the work of Sibley and Wagon, who proved that 3 colors suffice to color any collection of 2D parallelograms glued edge-to-edge. Their proof ...
Mirela Damian, Joseph O'Rourke
CCCG
2004
13 years 11 months ago
Local properties of geometric graphs
We propose a definition of locality for properties of geometric graphs. We measure the local density of graphs using region-counting distances [8] between pairs of vertices, and w...
Jean Cardinal, Sébastien Collette, Stefan L...
CCCG
2004
13 years 11 months ago
Separating points by axis-parallel lines
Gruia Calinescu, Adrian Dumitrescu, Peng-Jun Wan
CCCG
2004
13 years 11 months ago
Transformations and algorithms for least sum of squares hypersphere fitting
Michael Burr, Alan Cheng, Ryan Coleman, Diane L. S...
CCCG
2004
13 years 11 months ago
Continuous foldability of polygonal paper
We prove that any given well-behaved folded state of a piece of paper can be reached via a continuous folding process starting from the unfolded paper and ending with the folded st...
Erik D. Demaine, Satyan L. Devadoss, Joseph S. B. ...