Sciweavers

203 search results - page 16 / 41
» Incremental computation of planar maps
Sort
View
COMPGEOM
1994
ACM
15 years 3 months ago
Constructing Levels in Arrangements and Higher Order Voronoi Diagrams
We give simple randomized incremental algorithms for computing the k-level in an arrangement of n lines in the plane or in an arrangement of n planes in R3. The expected running ti...
Pankaj K. Agarwal, Mark de Berg, Jirí Matou...
CAD
2007
Springer
14 years 11 months ago
Generating strictly non-self-overlapping structured quadrilateral grids
In this paper, we present a BPM (Bézier Patch Mapping) algorithm which generates a strictly non-self-overlapping structured quadrilateral grid in a given four-sided planar region...
Hongwei Lin, Kai Tang, Ajay Joneja, Hujun Bao
ECCV
2002
Springer
16 years 1 months ago
New Techniques for Automated Architectural Reconstruction from Photographs
Abstract. We investigate a strategy for reconstructing of buildings from multiple (uncalibrated) images. In a similar manner to the Facade approach we first generate a coarse piece...
Tomás Werner, Andrew Zisserman
CVPR
2008
IEEE
14 years 12 months ago
Hallucinating 3D facial shapes
This paper focuses on hallucinating a facial shape from a low-resolution 3D facial shape. Firstly, we give a constrained conformal embedding of 3D shape in R2 , which establishes ...
Gang Pan, Song Han, Zhaohui Wu
IJRR
2011
78views more  IJRR 2011»
14 years 6 months ago
Online and Incremental Appearance-based SLAM in Highly Dynamic Environments
This paper presents a novel method for online and incremental appearance-based localization and mapping in a highly dynamic environment. Using position-invariant robust features (...
Aram Kawewong, Noppharit Tongprasit, Sirinart Tang...