2877 search results - page 22 / 576 » The Complexity of Planarity Testing |
COCO
2007
Springer
15 years 5 months ago
2007
Springer
We make progress in understanding the complexity of the graph reachability problem in the context of unambiguous logarithmic space computation; a restricted form of nondeterminism....
GRAPHICSINTERFACE
2007
15 years 24 days ago
2007
Material limitations and fabrication costs generally run at odds with the creativity of architectural design, producing a wealth of challenging computational geometry problems. We...
104
click to vote
CORR
2011
Springer
14 years 6 months ago
2011
Springer
We present a new certified and complete algorithm to compute arrangements of real planar algebraic curves. Our algorithm provides a geometric-topological analysis of the decompos...
COMPGEOM
2009
ACM
15 years 5 months ago
2009
ACM
It was shown in [11] that any orientable graph of genus g can be probabilistically embedded into a graph of genus g − 1 with constant distortion. Removing handles one by one giv...
ICAPR
2001
Springer
15 years 3 months ago
2001
Springer
Abstract. In this contribution, a novel and robust, geometry-based grouping strategy is proposed. Repeated, planar patterns in special relative positions are detected. The grouping...