Sciweavers

378 search results - page 55 / 76
» Computing discrete shape operators on general meshes
Sort
View
COMPGEOM
2006
ACM
15 years 3 months ago
Algorithms for two-box covering
We study the problem of covering a set of points or polyhedra in 3 with two axis-aligned boxes in order to minimize a function of the measures of the two boxes, such as the sum or...
Esther M. Arkin, Gill Barequet, Joseph S. B. Mitch...
IEEEPACT
2008
IEEE
15 years 3 months ago
Redundancy elimination revisited
This work proposes and evaluates improvements to previously known algorithms for redundancy elimination. Enhanced Scalar Replacement combines two classic techniques, scalar replac...
Keith D. Cooper, Jason Eckhardt, Ken Kennedy
PRL
2008
122views more  PRL 2008»
14 years 9 months ago
Constraints for closest point finding
The traditional closest point criterion has been widely used for 3D free form shape matching, object recognition, internet search, computer graphics and medical imaging. However, ...
Yonghuai Liu
SIGGRAPH
2010
ACM
15 years 1 months ago
A connection between partial symmetry and inverse procedural modeling
In this paper, we address the problem of inverse procedural modeling: Given a piece of exemplar 3D geometry, we would like to find a set of rules that describe objects that are s...
Martin Bokeloh, Michael Wand, Hans-Peter Seidel
BMCBI
2002
131views more  BMCBI 2002»
14 years 9 months ago
Efficient Boolean implementation of universal sequence maps (bUSM)
Background: Recently, Almeida and Vinga offered a new approach for the representation of arbitrary discrete sequences, referred to as Universal Sequence Maps (USM), and discussed ...
John Schwacke, Jonas S. Almeida