Sciweavers

22 search results - page 4 / 5
» The combinatorial encoding of disjoint convex sets in the pl...
Sort
View
ENDM
2008
142views more  ENDM 2008»
13 years 5 months ago
Augmenting the Connectivity of Planar and Geometric Graphs
In this paper we study some connectivity augmentation problems. Given a connected graph G with some desirable property, we want to make G 2-vertex connected (or 2-edge connected) ...
Ignaz Rutter, Alexander Wolff
SODA
1992
ACM
140views Algorithms» more  SODA 1992»
13 years 6 months ago
Separation and Approximation of Polyhedral Objects
Given a family of disjoint polygons P1, P2, : : :, Pk in the plane, and an integer parameter m, it is NP-complete to decide if the Pi's can be pairwise separated by a polygon...
Joseph S. B. Mitchell, Subhash Suri
ISVD
2007
IEEE
13 years 11 months ago
Voronoi Diagram with Respect to Criteria on Vision Information
Voronoi diagram for a set of geometric objects is a partition of the plane (or space in higher dimensions) into disjoint regions each dominated by some given object under a predet...
Tetsuo Asano, Naoki Katoh, Hisao Tamaki, Takeshi T...
CORR
2011
Springer
197views Education» more  CORR 2011»
13 years 9 days ago
Arrangements of double pseudolines
We define a double pseudoline as a simple closed curve in the open M¨obius band homotopic to the double of its core circle, and we define an arrangement of double pseudolines a...
Luc Habert, Michel Pocchiola
SIAMDM
2000
103views more  SIAMDM 2000»
13 years 5 months ago
Directional Routing via Generalized st-Numberings
We present a mathematical model for network routing based on generating paths in a consistent direction. Our development is based on an algebraic and geometric framework for defini...
Fred S. Annexstein, Kenneth A. Berman