Sciweavers

203 search results - page 8 / 41
» Incremental computation of planar maps
Sort
View
MFCS
1998
Springer
13 years 11 months ago
Facial Circuits of Planar Graphs and Context-Free Languages
It is known that a language is context-free iff it is the set of borders of the trees of recognizable set, where the border of a (labelled) tree is the word consisting of its leaf ...
Bruno Courcelle, Denis Lapoire
3DPVT
2006
IEEE
145views Visualization» more  3DPVT 2006»
14 years 1 months ago
The Recursive Multi-Frame Planar Parallax Algorithm
This paper presents a method for obtaining accurate dense elevation and appearance models of terrain using a single camera on-board an aerial platform. Applications of this method...
Christopher Geyer, Todd Templeton, Marci Meingast,...
FCT
2009
Springer
14 years 1 months ago
Martingales on Trees and the Empire Chromatic Number of Random Trees
We study the empire colouring problem (as defined by Percy Heawood in 1890) for maps whose dual planar graph is a tree, with empires formed by exactly r countries. We prove that, ...
Colin Cooper, Andrew R. A. McGrae, Michele Zito
WABI
2007
Springer
121views Bioinformatics» more  WABI 2007»
14 years 1 months ago
Seeded Tree Alignment and Planar Tanglegram Layout
The optimal transformation of one tree into another by means of elementary edit operations is an important algorithmic problem that has several interesting applications to computat...
Antoni Lozano, Ron Y. Pinter, Oleg Rokhlenko, Gabr...
ICCV
2009
IEEE
14 years 12 months ago
Piecewise Planar Stereo for Image-based Rendering
We present a novel multi-view stereo method designed for image-based rendering that generates piecewise planar depth maps from an unordered collection of photographs. First a di...
Sudipta N. Sinha, Drew Steedly and Richard Szelisk...