Sciweavers

1245 search results - page 23 / 249
» Triangulation for Points on Lines
Sort
View
AGILE
2009
Springer
343views GIS» more  AGILE 2009»
15 years 4 months ago
Line Decomposition Based on Critical Points Detection
The problem of line simplification is a recurrent problem in cartography. The purpose is to remove irrelevant details while emphasising the main features of the line. Most of the ...
Eric Guilbert
ASE
2011
14 years 4 months ago
Compositional model checking of software product lines using variation point obligations
This paper introduces a technique for incremental and compositional model checking that allows efficient reuse of model-checking results associated with the features in a product l...
Jing Liu, Samik Basu, Robyn R. Lutz
70
Voted
DCG
2008
86views more  DCG 2008»
14 years 9 months ago
Reconstruction Using Witness Complexes
We present a novel reconstruction algorithm that, given an input point set sampled from an object S, builds a one-parameter family of complexes that approximate S at different sca...
Leonidas J. Guibas, Steve Oudot
ICPR
2004
IEEE
15 years 10 months ago
Rigorous Accuracy Bounds for Calibrated Stereo Reconstruction
We deal with the problem of obtaining rigorous bounds to the position of 3-D points computed by stereo triangulation when both the camera matrix and the image points are affected ...
Alessandro Busti, Andrea Fusiello, Arrigo Benedett...
WG
2010
Springer
14 years 8 months ago
Connections between Theta-Graphs, Delaunay Triangulations, and Orthogonal Surfaces
Θk-graphs are geometric graphs that appear in the context of graph navigation. The shortest-path metric of these graphs is known to approximate the Euclidean complete graph up to...
Nicolas Bonichon, Cyril Gavoille, Nicolas Hanusse,...