1633 search results - page 157 / 327 » Planar Map Graphs |
ASPDAC
2001
ACM
14 years 2 months ago
2001
ACM
Abstract-- We describe new graph bipartization algorithms for layout modification and phase assignment of bright-field alternating phaseshifting masks (AltPSM) [25]. The problem of...
DAM
2007
13 years 10 months ago
2007
In 1997 Lampert and Slater introduced parallel knock-out schemes, an iterative process on graphs that goes through several rounds. In each round of this process, every vertex elim...
ECCV
2008
Springer
15 years 19 days ago
2008
Springer
This paper shows how computational Riemannian manifold can be used to solve several problems in computer vision and graphics. Indeed, Voronoi segmentations and Delaunay graphs comp...
TVCG
2012
12 years 1 months ago
2012
—We present a new approach for time-varying graph drawing that achieves both spatiotemporal coherence and multifocus+context visualization in a single framework. Our approach uti...
SIAMDM
2010
13 years 5 months ago
2010
Abstract. Squaregraphs were originally defined as finite plane graphs in which all inner faces are quadrilaterals (i.e., 4-cycles) and all inner vertices (i.e., the vertices not in...