Sciweavers

21 search results - page 3 / 5
» comgeo 2006
Sort
View
COMGEO
2006
ACM
13 years 11 months ago
An exact and efficient approach for computing a cell in an arrangement of quadrics
We present an approach for the exact and efficient computation of a cell in an arrangement of quadric surfaces. All calculations are based on exact rational algebraic methods and ...
Elmar Schömer, Nicola Wolpert
COMGEO
2006
ACM
13 years 11 months 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...
COMGEO
2007
ACM
13 years 10 months ago
An incremental algorithm for reconstruction of surfaces of arbitrary codimension
A new algorithm is presented for surface reconstruction from unorganized points. Unlike many previous algorithms, this algorithm does not select a subcomplex of the Delaunay Trian...
Daniel Freedman
COMGEO
2007
ACM
13 years 10 months ago
Drawings of planar graphs with few slopes and segments
We study straight-line drawings of planar graphs with few segments and few slopes. Optimal results are obtained for all trees. Tight bounds are obtained for outerplanar graphs, 2-...
Vida Dujmovic, David Eppstein, Matthew Suderman, D...
COMGEO
2006
ACM
13 years 11 months 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