Sciweavers

2638 search results - page 66 / 528
» Random Geometric Complexes
Sort
View
181
Voted
TSMC
2008
225views more  TSMC 2008»
15 years 2 months ago
Robust Methods for Geometric Primitive Recovery and Estimation From Range Images
We present a method for the recovery of partially occluded 3D geometric primitives from range images which might also include non-primitive objects. The method uses a technique for...
Irina Lavva, Eyal Hameiri, Ilan Shimshoni
152
Voted
WADS
2007
Springer
180views Algorithms» more  WADS 2007»
15 years 8 months ago
Spanners for Geometric Intersection Graphs
A ball graph is an intersection graph of a set of balls with arbitrary radii. Given a real number t > 1, we say that a subgraph G′ of a graph G is a t-spanner of G, if for eve...
Martin Fürer, Shiva Prasad Kasiviswanathan
CAD
2011
Springer
14 years 6 months ago
Principal curvature ridges and geometrically salient regions of parametric B-spline surfaces
Ridges are characteristic curves of a surface that mark salient intrinsic features of its shape and are therefore valuable for shape matching, surface quality control, visualizati...
Suraj Musuvathy, Elaine Cohen, James N. Damon, Joo...
120
Voted
STOC
1994
ACM
93views Algorithms» more  STOC 1994»
15 years 6 months ago
Scalable expanders: exploiting hierarchical random wiring
Recent work has shown many advantages to randomly wired expander-based networks. Unfortunately, the wiring complexity of such networks becomes physically problematic as they becom...
Eric A. Brewer, Frederic T. Chong, Tom Leighton
112
Voted
DCG
1999
81views more  DCG 1999»
15 years 2 months ago
Properties of Random Triangulations and Trees
Let Tn denote the set of triangulations of a convex polygon K with n sides. We study functions that measure very natural "geometric" features of a triangulation Tn, fo...
Luc Devroye, Philippe Flajolet, Ferran Hurtado, Ma...