Sciweavers

1633 search results - page 100 / 327
» Planar Map Graphs
Sort
View
COMBINATORICA
2007
56views more  COMBINATORICA 2007»
13 years 10 months ago
On embeddability and stresses of graphs
Gluck [6] has proven that triangulated 2-spheres are generically 3-rigid. Equivalently, planar graphs are generically 3-stress free. We show that already the K5-minor freeness gua...
Eran Nevo
COMPGEOM
2010
ACM
14 years 3 months ago
Constructing Reeb graphs using cylinder maps
The Reeb graph of a scalar function represents the evolution of the topology of its level sets. In this video, we describe a near-optimal output-sensitive algorithm for computing ...
Harish Doraiswamy, Aneesh Sood, Vijay Natarajan
DATE
2003
IEEE
90views Hardware» more  DATE 2003»
14 years 3 months ago
Mapping Applications to an FPFA Tile
Abstract— This paper introduces a transformational design method which can be used to map code written in a high level source language, like C, to a coarse grain reconfigurable ...
Michèl A. J. Rosien, Yuanqing Guo, Gerard J...
ECCV
2006
Springer
15 years 5 days ago
A Multiview Approach to Tracking People in Crowded Scenes Using a Planar Homography Constraint
Occlusion and lack of visibility in dense crowded scenes make it very difficult to track individual people correctly and consistently. This problem is particularly hard to tackle i...
Saad M. Khan, Mubarak Shah
SODA
1997
ACM
169views Algorithms» more  SODA 1997»
13 years 11 months ago
Partial Matching of Planar Polylines Under Similarity Transformations
Given two planar polylines T and P with n and m edges, respectively, we present an Om2 n2  time, Omn space algorithm to nd portions of the text" T which are similar in sh...
Scott D. Cohen, Leonidas J. Guibas