It is shown that for every finite set of disjoint convex polygonal obstacles in the plane, with a total of n vertices, the free space around the obstacles can be partitioned into ...
Marwan Al-Jubeh, Michael Hoffmann, Mashhood Ishaqu...
Abstract. We present new approximation schemes for various classical problems of finding the minimum-weight spanning subgraph in edge-weighted undirected planar graphs that are re...
We propose a geometric constraint solving method based on connectivity analysis in graph theory, which can be used to decompose a well-constrained problem into some smaller ones i...
Consider a planar straight line graph (PSLG), G, with k connected components, k 2. We show that if no component is a singleton, we can always find a vertex in one component that s...
Ferran Hurtado, Mikio Kano, David Rappaport, Csaba...
This paper addresses the problem of representing the connectivity information of geometric objects using as little memory as possible. As opposed to raw compression issues, the fo...