Sciweavers

4022 search results - page 80 / 805
» Adaptive Sweeping Techniques
Sort
View
VISUALIZATION
2005
IEEE
14 years 3 months ago
Surface Reconstruction Via Contour Metamorphosis: An Eulerian Approach With Lagrangian Particle Tracking
We present a robust method for 3D reconstruction of closed surfaces from sparsely sampled parallel contours. A solution to this problem is especially important for medical segment...
Ola Nilsson, David E. Breen, Ken Museth
CVBIA
2005
Springer
14 years 3 months ago
Local or Global Minima: Flexible Dual-Front Active Contours
Most variational active contour models are designed to find the “desirable” local minima of data-dependent energy functionals with the hope of avoiding undesirable configurat...
Hua Li, Anthony J. Yezzi
SMA
2003
ACM
163views Solid Modeling» more  SMA 2003»
14 years 3 months ago
Fast swept volume approximation of complex polyhedral models
We present an efficient algorithm to approximate the swept volume (SV) of a complex polyhedron along a given trajectory. Given the boundary description of the polyhedron and a pat...
Young J. Kim, Gokul Varadhan, Ming C. Lin, Dinesh ...
ASPDAC
2007
ACM
98views Hardware» more  ASPDAC 2007»
14 years 2 months ago
Node Mergers in the Presence of Don't Cares
Abstract-- SAT sweeping is the process of merging two or more functionally equivalent nodes in a circuit by selecting one of them to represent all the other equivalent nodes. This ...
Stephen Plaza, Kai-Hui Chang, Igor L. Markov, Vale...
COMPGEOM
1995
ACM
14 years 1 months ago
The Rectangle Enclosure and Point-Dominance Problems Revisited
We consider the problem of reporting the pairwise enclosures in a set of n axesparallel rectangles in IR2, which is equivalent to reporting dominance pairs in a set of n points in...
Prosenjit Gupta, Ravi Janardan, Michiel H. M. Smid...