2877 search results - page 44 / 576 » The Complexity of Planarity Testing |
119
Voted
CORR
2008
Springer
15 years 3 months ago
2008
Springer
We provide linear-time algorithms for geometric graphs with sublinearly many crossings. That is, we provide algorithms running in O(n) time on connected geometric graphs having n ...
117
Voted
CGF
2006
15 years 3 months ago
2006
We describe a system for the rapid acquisition of building interiors. In 40 hours, a two member team with a single acquisition device captured a model of the corridors and 20 indi...
121
Voted
ATMOS
2010
15 years 2 months ago
2010
We study variants of the vertex disjoint paths problem in planar graphs where paths have to be selected from a given set of paths. We study the problem as a decision, maximization...
128
Voted
TVCG
2010
15 years 2 months ago
2010
—This paper presents the first practical method for “origamizing” or obtaining the folding pattern that folds a single sheet of material into a given polyhedral surface with...
131
Voted
TIT
2011
14 years 10 months ago
2011
Abstract—This work addresses the computational complexity of achieving the capacity of a general network coding instance. We focus on the linear capacity, namely the capacity of ...