Sciweavers

COMGEO
2006
ACM
14 years 15 days ago
Online searching with an autonomous robot
Sándor P. Fekete, Rolf Klein, Andreas N&uum...
COMGEO
2006
ACM
14 years 15 days ago
Inner and outer rounding of Boolean operations on lattice polygonal regions
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementat...
Olivier Devillers, Philippe Guigue
COMGEO
2006
ACM
14 years 15 days ago
Compatible triangulations and point partitions by series-triangular graphs
We introduce series-triangular graph embeddings and show how to partition point sets with them. This result is then used to prove an upper bound on the number of Steiner points nee...
Jeff Danciger, Satyan L. Devadoss, Don Sheehy
COMGEO
2006
ACM
14 years 15 days ago
On the sizes of Delaunay meshes
Let P be a polyhedral domain occupying a convex volume. We prove that the size of a graded mesh of P with bounded vertex degree is within a factor O(H3 P ) of the size of any Dela...
Siu-Wing Cheng
COMGEO
2006
ACM
14 years 15 days ago
Cost prediction for ray shooting in octrees
The ray shooting problem arises in many different contexts and is a bottleneck of ray tracing in computer graphics. Unfortunately, theoretical solutions to the problem are not ver...
Boris Aronov, Hervé Brönnimann, Allen ...
COMGEO
2006
ACM
14 years 15 days ago
Moving coins
We consider combinatorial and computational issues that are related to the problem of moving coins from one configuration to another. Coins are defined as non-overlapping discs, an...
Manuel Abellanas, Sergey Bereg, Ferran Hurtado, Al...