98 search results - page 1 / 20 » A Rectilinearity Measurement for Polygons |
ECCV
2002
Springer
14 years 7 months ago
2002
Springer
In this paper we define a function R(P) which is defined for any polygon P and which maps a given polygon P into a number from the interval (0, 1]. The number R(P) can be used as a...
CORR
2012
Springer
12 years 1 months ago
2012
Springer
We show how to compute cartograms with worst-case optimal polygonal complexity. Specifically we study rectilinear duals which are side-contact representations of a planar graph G ...
ASPDAC
2005
ACM
13 years 7 months ago
2005
ACM
— Motivated by VLSI/ULSI routing applications, we present a heuristic for rectilinear Steiner minimal tree (RSMT) construction. We transform a rectilinear minimum spanning tree (...
STOC
1999
ACM
13 years 9 months ago
1999
ACM
We give an O( log n) factor approximation algorithm for covering a rectilinear polygon with holes using axis-parallel rectangles. This is the first polynomial time approximation a...
GIS
2006
ACM
14 years 6 months ago
2006
ACM
A cartogram is a thematic map that visualizes statistical data about a set of regions like countries, states or provinces. The size of a region in a cartogram corresponds to a par...