Sciweavers

91 search results - page 13 / 19
» Triangulating a Plane
Sort
View
CORR
2007
Springer
132views Education» more  CORR 2007»
14 years 9 months ago
Nodally 3-connected planar graphs and convex combination mappings
A barycentric mapping of a planar graph is a plane embedding in which every internal vertex is the average of its neighbours. A celebrated result of Tutte’s [16] is that if a pl...
Colm Ó'Dúnlaing
CG
2004
Springer
14 years 9 months ago
Surface processing methods for point sets using finite elements
We present a framework for processing point-based surfaces via partial differential equations (PDEs). Our framework efficiently and effectively brings well-known PDE-based process...
Ulrich Clarenz, Martin Rumpf, Alexandru Telea
CVPR
2005
IEEE
15 years 11 months ago
Complex 3D Shape Recovery Using a Dual-Space Approach
This paper presents a novel method for reconstructing complex 3D objects with unknown topology using silhouettes extracted from image sequences. This method exploits the duality p...
Chen Liang, Kwan-Yee Kenneth Wong
3DGIS
2006
Springer
15 years 3 months ago
Building Reconstruction - Outside and In
The modelling or reconstruction of buildings has two aspects – on the one hand we need a data structure and the associated geometric information, and on the other hand we need a...
Christopher M. Gold, Rebecca O. C. Tse, Hugo Ledou...
ESA
1999
Springer
95views Algorithms» more  ESA 1999»
15 years 1 months ago
A Fast General Methodology for Information - Theoretically Optimal Encodings of Graphs
We propose a fast methodology for encoding graphs with information-theoretically minimum numbers of bits. Specifically, a graph with property π is called a π-graph. If π satis...
Xin He, Ming-Yang Kao, Hsueh-I Lu