Sciweavers

22 search results - page 3 / 5
» Computing Triangulations Using Oriented Matroids
Sort
View
CAD
2005
Springer
13 years 10 months ago
A Delaunay-based region-growing approach to surface reconstruction from unorganized points
This paper presents a Delaunay-based region-growing (DBRG) surface reconstruction algorithm that holds the advantages of both Delaunay-based and region-growing approaches. The pro...
Chuan-Chu Kuo, Hong-Tzong Yau
BMVC
2002
14 years 1 months ago
Improving architectural 3D reconstruction by plane and edge constraining
This paper presents new techniques for improving the structural quality of automatically acquired architectural 3D models. Common architectural features like parallelism and ortho...
H. Cantzler, Robert B. Fisher, Michel Devy
COMPGEOM
1996
ACM
14 years 3 months ago
Robust Adaptive Floating-Point Geometric Predicates
Fast C implementations of four geometric predicates, the 2D and 3D orientation and incircle tests, are publicly available. Their inputs are ordinary single or double precision flo...
Jonathan Richard Shewchuk
CGF
2010
101views more  CGF 2010»
13 years 11 months ago
High Fidelity Scan Merging
For each scanned object 3D triangulation laser scanners deliver multiple sweeps corresponding to multiple laser motions and orientations. The problem of aligning these scans has b...
J. Digne, J.-M. Morel, N. Audfray, C. Lartigue
COMPGEOM
2003
ACM
14 years 4 months ago
Loops in reeb graphs of 2-manifolds
Given a Morse function over a 2-manifold with or without boundary, the Reeb graph is obtained by contracting the connected components of the level sets to points. We prove tight u...
Kree Cole-McLaughlin, Herbert Edelsbrunner, John H...