Sciweavers

2601 search results - page 37 / 521
» A Point in Many Triangles
Sort
View
CAGD
2010
215views more  CAGD 2010»
13 years 7 months ago
Surface fitting and registration of point clouds using approximations of the unsigned distance function
Many problems in computer aided geometric design and geometry processing are stated as least
Simon Flöry, Michael Hofer
CGF
2008
153views more  CGF 2008»
13 years 7 months ago
Computing Local Signed Distance Fields for Large Polygonal Models
The signed distance field for a polygonal model is a useful representation that facilitates efficient computation in many visualization and geometric processing tasks. Often it is...
Byungjoon Chang, Deukhyun Cha, Insung Ihm
SMA
2008
ACM
203views Solid Modeling» more  SMA 2008»
13 years 7 months ago
Interactive continuous collision detection between deformable models using connectivity-based culling
We present an interactive algorithm for continuous collision detection between deformable models. We introduce two techniques to improve the culling efficiency and reduce the numb...
Min Tang, Sean Curtis, Sung-Eui Yoon, Dinesh Manoc...
PAKDD
2011
ACM
209views Data Mining» more  PAKDD 2011»
12 years 10 months ago
Spectral Analysis for Billion-Scale Graphs: Discoveries and Implementation
Abstract. Given a graph with billions of nodes and edges, how can we find patterns and anomalies? Are there nodes that participate in too many or too few triangles? Are there clos...
U. Kang, Brendan Meeder, Christos Faloutsos
ISVD
2007
IEEE
14 years 2 months ago
Voronoi Diagram with Respect to Criteria on Vision Information
Voronoi diagram for a set of geometric objects is a partition of the plane (or space in higher dimensions) into disjoint regions each dominated by some given object under a predet...
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi T...