Sciweavers

665 search results - page 102 / 133
» Algorithms for Triangulated Terrains
Sort
View
ICRA
2007
IEEE
155views Robotics» more  ICRA 2007»
15 years 4 months ago
Swept Volume approximation of polygon soups
— We present a fast GPU-based algorithm to approximate the Swept Volume (SV) boundary of arbitrary polygon soup models. Despite the extensive research on calculating the volume s...
Jesse C. Himmelstein, Etienne Ferre, Jean-Paul Lau...
SMI
2003
IEEE
131views Image Analysis» more  SMI 2003»
15 years 3 months ago
Watermarking 2D Vector Maps in the Mesh-Spectral Domain
This paper proposes a digital watermarking algorithm for 2D vector digital maps. The watermark is a robust, informed-detection watermark to be used to prevent such abuses as an in...
Ryutarou Ohbuchi, Hiroo Ueda, Shuh Endoh
COMPGEOM
2003
ACM
15 years 3 months ago
Anisotropic voronoi diagrams and guaranteed-quality anisotropic mesh generation
We introduce anisotropic Voronoi diagrams, a generalization of multiplicatively weighted Voronoi diagrams suitable for generating guaranteed-quality meshes of domains in which lon...
François Labelle, Jonathan Richard Shewchuk
IPPS
1994
IEEE
15 years 1 months ago
Efficient Matrix Chain Ordering in Polylog Time
The matrix chain ordering problem is to find the cheapest way to multiply a chain of n matrices, where the matrices are pairwise compatible but of varying dimensions. Here we give ...
Phillip G. Bradford, Gregory J. E. Rawlins, Gregor...
GRAPHICSINTERFACE
2007
14 years 11 months ago
Surface distance maps
We present an interactive algorithm to compute surface distance maps for triangulated models. The distance map represents the distance-to-closest-primitive mapping at each point o...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, E...