Sciweavers

83 search results - page 5 / 17
» Deflating polygons to the limit
Sort
View
JGS
2006
113views more  JGS 2006»
14 years 9 months ago
Pattern based map comparisons
Map comparison techniques based on a pixel-by-pixel comparison are useful for many purposes, but fail to reveal important aspects of map similarities and differences. In contrast, ...
Roger White
AAAI
2007
15 years 2 days ago
Simple Robots with Minimal Sensing: From Local Visibility to Global Geometry
We consider problems of geometric exploration and selfdeployment for simple robots that can only sense the combinatorial (non-metric) features of their surroundings. Even with suc...
Subhash Suri, Elias Vicari, Peter Widmayer
ADCM
2007
84views more  ADCM 2007»
14 years 10 months ago
A non-linear circle-preserving subdivision scheme
We describe a new method for constructing a sequence of refined polygons, which starts with a sequence of points and associated normals. The newly generated points are sampled fr...
Pavel Chalmovianský, Bert Jüttler
GRAPHITE
2004
ACM
15 years 3 months ago
Robust, geometry-independent shadow volumes
A novel algorithm is presented that overcomes limitations of existing shadow volume algorithms when dealing with nonmanifold geometry and space partitioning. This simple algorithm...
Graham Aldridge, Eric Woods
CGI
2004
IEEE
15 years 1 months ago
Efficient Hardware Voxelization
This paper presentes a novel algorithm for the voxelization of surface models of arbitrary topology. Our algorithm uses the depth and stencil buffers, available in most commercial...
Georgios Passalis, Ioannis A. Kakadiaris, Theohari...