Sciweavers

2183 search results - page 156 / 437
» Multi-pass geometric algorithms
Sort
View
COMPGEOM
2011
ACM
14 years 10 months ago
Deconstructing approximate offsets
We consider the offset-deconstruction problem: Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum o...
Eric Berberich, Dan Halperin, Michael Kerber, Roza...
SI3D
2006
ACM
16 years 7 days ago
Interactive 3D distance field computation using linear factorization
We present an interactive algorithm to compute discretized 3D Euclidean distance fields. Given a set of piecewise linear geometric primitives, our algorithm computes the distance...
Avneesh Sud, Naga K. Govindaraju, Russell Gayle, D...
COMPGEOM
2008
ACM
15 years 8 months ago
Routing a maximum number of disks through a scene of moving obstacles
This video illustrates an algorithm for computing a maximum number of disjoint paths for unit disks moving among a set of dynamic obstacles in the plane. The problem is motivated ...
Joondong Kim, Joseph S. B. Mitchell, Valentin Poli...
TVCG
2008
103views more  TVCG 2008»
15 years 6 months ago
Perceptually Guided Polygon Reduction
The properties of the human visual system are taken into account, along with the geometric aspects of an object, in a new surface remeshing algorithm and a new mesh simplification ...
Lijun Qu, Gary W. Meyer
CGF
2005
111views more  CGF 2005»
15 years 6 months ago
Hierarchyless Simplification, Stripification and Compression of Triangulated Two Manifolds
In this paper we explore the algorithmic space in which stripification, simplification and geometric compression of triangulated 2-manifolds overlap. Edge-collase/uncollapse based...
Pablo Diaz-Gutierrez, Meenakshisundaram Gopi, Rena...