Sciweavers

450 search results - page 14 / 90
» Quadrangulations of Planar Sets
Sort
View
GD
2007
Springer
14 years 3 months ago
Minimum Level Nonplanar Patterns for Trees
We add two minimum level nonplanar (MLNP) patterns for trees to the previous set of tree patterns given by Healy et al. [3]. Neither of these patterns match any of the previous pat...
J. Joseph Fowler, Stephen G. Kobourov
CCCG
2003
13 years 10 months ago
Degree Bounds for Constrained Pseudo-Triangulations
We introduce the concept of a constrained pointed pseudo-triangulation TG of a point set S with respect to a pointed planar straight line graph G = (S, E). For the case that G for...
Oswin Aichholzer, Michael Hoffmann, Bettina Speckm...
GD
2005
Springer
14 years 2 months ago
Non-planar Core Reduction of Graphs
We present a reduction method that reduces a graph to a smaller core graph which behaves invariant with respect to planarity measures like crossing number, skewness, and thickness....
Carsten Gutwenger, Markus Chimani
ESA
2004
Springer
132views Algorithms» more  ESA 2004»
14 years 2 months ago
Seeking a Vertex of the Planar Matching Polytope in NC
For planar graphs, counting the number of perfect matchings (and hence determining whether there exists a perfect matching) can be done in NC [4, 10]. For planar bipartite graphs, ...
Raghav Kulkarni, Meena Mahajan
CVPR
2006
IEEE
14 years 11 months ago
A Planar Light Probe
We develop a novel technique for measuring lighting that exploits the interaction of light with a set of custom BRDFs. This enables the construction of a planar light probe with c...
Neil G. Alldrin, David J. Kriegman