Sciweavers

2093 search results - page 199 / 419
» Statistical Point Geometry
Sort
View
STACS
2001
Springer
15 years 8 months ago
Approximation Algorithms for the Bottleneck Stretch Factor Problem
The stretch factor of a Euclidean graph is the maximum ratio of the distance in the graph between any two points and their Euclidean distance. Given a set S of n points in Rd, we ...
Giri Narasimhan, Michiel H. M. Smid
SMILE
1998
Springer
15 years 8 months ago
From Ordinal to Euclidean Reconstruction with Partial Scene Calibration
Abstract. Since uncalibrated images permit only projective reconstruction, metric information requires either camera or scene calibration. We propose a stratified approach to proje...
Daphna Weinshall, P. Anandan, Michal Irani
ICALP
2007
Springer
15 years 8 months ago
Online Conflict-Free Colorings for Hypergraphs
We provide a framework for online conflict-free coloring (CF-coloring) of any hypergraph. We use this framework to obtain an efficient randomized online algorithm for CF-coloring ...
Amotz Bar-Noy, Panagiotis Cheilaris, Svetlana Olon...
VISSYM
2007
15 years 6 months ago
Model-free Surface Visualization of Vascular Trees
Expressive and efficient visualizations of complex vascular structures are essential for medical applications, such as diagnosis and therapy planning. A variety of techniques has ...
Christian Schumann, Steffen Oeltze, Ragnar Bade, B...
153
Voted
SGP
2004
15 years 6 months ago
Shape Segmentation Using Local Slippage Analysis
We propose a method for segmentation of 3D scanned shapes into simple geometric parts. Given an input point cloud, our method computes a set of components which possess one or mor...
Natasha Gelfand, Leonidas J. Guibas