Sciweavers

203 search results - page 3 / 41
» Incremental computation of planar maps
Sort
View
CVPR
2005
IEEE
14 years 9 months ago
Conformal Deskewing of Non-Planar Documents
This paper presents an approach that uses conformal mapping to parameterize a document's 3D shape to a 2D plane. Using this conformal parametrization, a restorative mapping b...
Michael S. Brown, Charles J. Pisula
IJBC
2002
86views more  IJBC 2002»
13 years 6 months ago
Symbolic Dynamics from homoclinic tangles
We give a method for finding symbolic dynamics for a planar diffeomorphism with a homoclinic tangle. The method only requires a finite piece of tangle, which can be computed with ...
Pieter Collins
DAC
2000
ACM
14 years 8 months ago
Depth optimal incremental mapping for field programmable gate arrays
In this paper, we study the incremental t echnology mapping problem for lookup-table (LUT) based Field Programmable Gate Arrays (FPGAs) under incremental changes. Given a gate-lev...
Jason Cong, Hui Huang
SODA
2003
ACM
143views Algorithms» more  SODA 2003»
13 years 8 months ago
Matching planar maps
The subject of this paper are algorithms for measuring the similarity of patterns of line segments in the plane, a standard problem in, e.g., computer vision, geographic informati...
Helmut Alt, Alon Efrat, Günter Rote, Carola W...
CORR
2007
Springer
132views Education» more  CORR 2007»
13 years 7 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