2188 search results - page 157 / 438 » Instance-Optimal Geometric Algorithms |
163
click to vote
COMPGEOM
2011
ACM
14 years 7 months ago
2011
ACM
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...
146
click to vote
SI3D
2006
ACM
15 years 10 months ago
2006
ACM
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...
137
click to vote
COMPGEOM
2008
ACM
15 years 6 months ago
2008
ACM
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 ...
129
click to vote
TVCG
2008
15 years 4 months ago
2008
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 ...
141
click to vote
CGF
2005
15 years 4 months ago
2005
In this paper we explore the algorithmic space in which stripification, simplification and geometric compression of triangulated 2-manifolds overlap. Edge-collase/uncollapse based...