Sciweavers

2980 search results - page 458 / 596
» Computational Geometry
Sort
View
CCCG
2009
15 years 7 months ago
On the Dilation of Delaunay Triangulations of Points in Convex Position
Let S be a finite set of points in the Euclidean plane, and let E be the complete graph whose point-set is S. Chew, in 1986, proved a lower bound of /2 on the stretch factor of th...
Shiliang Cui, Iyad A. Kanj, Ge Xia
FAW
2010
Springer
259views Algorithms» more  FAW 2010»
15 years 7 months ago
Adaptive Algorithms for Planar Convex Hull Problems
We study problems in computational geometry from the viewpoint of adaptive algorithms. Adaptive algorithms have been extensively studied for the sorting problem, and in this paper ...
Hee-Kap Ahn, Yoshio Okamoto
CGF
2010
198views more  CGF 2010»
15 years 6 months ago
Feature Preserving Mesh Generation from 3D Point Clouds
We address the problem of generating quality surface triangle meshes from 3D point clouds sampled on piecewise smooth surfaces. Using a feature detection process based on the cova...
Nader Salman, Mariette Yvinec, Quentin Méri...
CORR
2008
Springer
126views Education» more  CORR 2008»
15 years 6 months ago
3D Building Model Fitting Using A New Kinetic Framework
We describe a new approach to fit the polyhedron describing a 3D building model to the point cloud of a Digital Elevation Model (DEM). We introduce a new kinetic framework that hi...
Mathieu Brédif, Didier Boldo, Marc Pierrot ...
SMA
2008
ACM
396views Solid Modeling» more  SMA 2008»
15 years 6 months ago
Fast mesh segmentation using random walks
3D mesh models are now widely available for use in various applications. The demand for automatic model analysis and understanding is ever increasing. Mesh segmentation is an impo...
Yu-Kun Lai, Shi-Min Hu, Ralph R. Martin, Paul L. R...