30 search results - page 3 / 6 » Crossing edges and faces of line arrangements in the plane |
156
click to vote
CCCG
2006
15 years 7 months ago
2006
Abstract. Given a set P of points and a set S of pairwise disjoint axis-parallel line segments in the plane, we construct a straight line spanning tree T on P such that every segme...
150
click to vote
ICPR
2004
IEEE
16 years 7 months ago
2004
IEEE
This paper describes a method for curvature dependant Skeletonisation in grey-scale images. We commence from a magnetostatic analogy, where the tangential edge flow (the cross pro...
204
click to vote
COCOA
2010
Springer
15 years 4 months ago
2010
Springer
A plane graph is a drawing of a planar graph in the plane such that no two edges cross each other. A rooted plane graph has a designated outer vertex. For given positive integers ...
163
click to vote
ISAAC
2004
Springer
15 years 11 months ago
2004
Springer
A drawing of a plane graph is called an inner rectangular drawing if every edge is drawn as a horizontal or vertical line segment so that every inner face is a rectangle. An inner ...
152
click to vote
COMPGEOM
2003
ACM
15 years 11 months ago
2003
ACM
Given a collection C of circles in the plane, we wish to construct the arrangement A(C) (namely the subdivision of the plane into vertices, edges and faces induced by C) using fl...