Sciweavers

188 search results - page 23 / 38
» Pointed Drawings of Planar Graphs
Sort
View
GD
2007
Springer
15 years 6 months ago
Simultaneous Geometric Graph Embeddings
We consider the following problem known as simultaneous geometric graph embedding (SGE). Given a set of planar graphs on a shared vertex set, decide whether the vertices can be pla...
Alejandro Estrella-Balderrama, Elisabeth Gassner, ...
CVPR
2009
IEEE
16 years 7 months ago
Efficient Planar Graph Cuts with Applications in Computer Vision
We present a fast graph cut algorithm for planar graphs. It is based on the graph theoretical work [2] and leads to an efficient method that we apply on shape matching and im- a...
Daniel Cremers, Eno Töppe, Frank R. Schmidt
ICCV
2007
IEEE
15 years 6 months ago
Fast Matching of Planar Shapes in Sub-cubic Runtime
The matching of planar shapes can be cast as a problem of finding the shortest path through a graph spanned by the two shapes, where the nodes of the graph encode the local simil...
Frank R. Schmidt, Dirk Farin, Daniel Cremers
PG
2007
IEEE
15 years 6 months ago
The Mental Canvas: A Tool for Conceptual Architectural Design and Analysis
We describe a computer graphics system that supports conceptual architectural design and analysis. We use as a starting point the traditional sketchbook drawings that architects u...
Julie Dorsey, Songhua Xu, Gabe Smedresman, Holly E...
INFORMATICALT
2006
80views more  INFORMATICALT 2006»
14 years 11 months ago
Scheduling Trajectories on a Planar Surface with Moving Obstacles
An algorithm for scheduling the trajectory of a point object, which moves on a plane surface comprising of moving obstacles, is introduced. Different quantitative criteria may be m...
Emmanuel Stefanakis