1557 search results - page 7 / 312 » On measuring areas of polygons |
SODA
2004
ACM
14 years 11 months ago
2004
ACM
We present a near-quadratic time algorithm that computes a point inside a simple polygon P having approximately the largest visibility polygon inside P, and a nearlinear time algo...
ICDM
2009
IEEE
15 years 4 months ago
2009
IEEE
— Redistricting is the process of dividing a geographic area into districts or zones. This process has been considered in the past as a problem that is computationally too comple...
65
Voted
DCG
2002
14 years 9 months ago
2002
CORR
2012
Springer
13 years 5 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 ...
ISD
1999
Springer
15 years 1 months ago
1999
Springer
One of the primary methods of studying change in the natural and man-made environment is that of comparison of multi-date maps and images of the earth's surface. Such comparis...