Advertisement

Weighted closest pairs

  • Michael Formann
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 665)

Abstract

In this paper we study the following scaling problem: Given a set of planar starshaped objects with centerpoints (in the kernel), determine the maximal scaling factor δmax, such that the objects scaled by δmax about their centerpoints are pairwise disjoint.

We describe a method to compute the maximal scaling factor for n disks with different radii in optimal O(n log n) time. In this case the problem can be viewed as computing the closest pair of a set of weighted points.

We indicate how to extend the method to a broader class of objects, including disks generated by L p -norms (1 ≤ p ≤ ∞).

A different approach, using the parametric search technique is taken to solve the scaling problem for an even wider class, namely starshaped, x-monotone objects. This method runs in O(n log2n) time. As a corollary of this result we can compute the maximal scaling factor of a set of starshaped polygons (not necessarily x-monotone) with a total number of n edges in O(n log2n) time.

Keywords

Scaling Factor Vertical Structure Voronoi Diagram Binary Search Close Pair 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [AE84]
    Franz Aurenhammer and Herbert Edelsbrunner. An optimal algorithm for constructing the weighted Voronoi diagram in the plane. Pattern Recognition, 17:251–257, 1984.Google Scholar
  2. [AKS83]
    Miklos Ajtai, János Komlós, and Endre Szemerèdi. An O(n log n) sorting network. Combinatorial, 3:1–19, 1983.Google Scholar
  3. [Anr87]
    Franz Aurenhammer. Power diagrams: properties, algorithms, and applications. SIAM J. Comput., pages 78–96, 1987.Google Scholar
  4. [BH92]
    Frank Bartling and Klaus Hinrichs. A plane-sweep algorithm for finding a closest pair among convex planar objects. In Proc. 9th Annual Symposium on Theoretical Aspects of Computer Science, pages 221–232, 1992.Google Scholar
  5. [BO79]
    Jon Bentley and Thomas Ottmann. Algorithms for reporting and counting geometric intersections. IEEE Trans. Comput., 28:643–647, 1979.Google Scholar
  6. [BS76]
    Jon Bentley and Michael I. Shamos. Divide and conquer in multidimensional space. In Proceedings 8th Annual Symp. Theory Comput., pages 220–230, 1976.Google Scholar
  7. [Col87]
    Richard Cole. Slowing down sorting networks to obtain faster sorting algorithms. J. Assoc. Comput. Mach., 34:200–208, 1987.Google Scholar
  8. [Col88]
    Richard Cole. Parallel merge sort. SIAM J. Comput., 17:770–785, 1988.Google Scholar
  9. [ERVV89]
    Herbert Edelsbrunner, Günter Rote, and Emo Welzl. Testing the necklace condition for shortest tours and optimal factors in the plane. Theoret. Comput. Sci., 66:157–180, 1989.Google Scholar
  10. [For87]
    Steven Fortune. A sweepline algorithm for Voronoi diagrams. Algorithmica 2, pages 153–174, 1987.Google Scholar
  11. [For93]
    Michael Formann. Algorithms for Geometric Packing and Scaling Problems. PhD thesis, Freie Universität Berlin, Fachbereich Mathematik, 1993.Google Scholar
  12. [HNS90]
    Klaus Hinrichs, Jurg Nievergelt, and Peter Shorn. Plane-sweep solves the closest pair problem elegantly. Information Processing Letters, pages 337–342, 1990.Google Scholar
  13. [Koe36]
    Paul Koebe. Kontaktprobleme der konformen Abbildung. Berichte der Verhandlungen der Sächsischen Akademie der Wissenschaften zu Leipzig, pages 141–164, 1936. Math.-Phys. Klasse 88.Google Scholar
  14. [Mat91]
    Jiří Matoušek. Randomized optimal algorithm for slope selection. Inform. Process. Lett., 39:183–187, 1991.Google Scholar
  15. [Meg83]
    Nimrod Megiddo. Linear-time algorithms for linear programming in R3 and related problems. SIAM J. Comput., 12:759–776, 1983.Google Scholar
  16. [MW89]
    Jiří Matoušek and Emo Welzl. Good splitters for counting points in triangles. In Proc. 5th Annual ACM Symposium on Computational Geometry, pages 124–130, 1989.Google Scholar
  17. [PS85]
    Franco Preparata and Michael I. Shamos. Computational Geometry: An introduction. Springer-Verlag, New York, 1985.Google Scholar
  18. [SH75]
    Michael I. Shamos and Dan J. Hoey. Closest-point problems. In Proc. 16th Annual IEEE Symposium on Foundations of Computer Science, pages 151–162, 1975.Google Scholar
  19. [SH76]
    Michael I. Shamos and Dan J. Hoey. Geometric intersection problems. In Proc. 17th Annual IEEE Symposium on Foundations of Computer Science, pages 208–215, 1976.Google Scholar
  20. [Sha85]
    Micha Sharir. Intersection and closest pair problems for a set of planar discs. SIAM J. Comput., 14:448–468, 1985.Google Scholar
  21. [Yap87]
    Chee Yap. An O(n log n) algorithm for the Voronoi diagram of a set of simple curve segments. Discrete Comput. Geom., 2:365–393, 1987.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1993

Authors and Affiliations

  • Michael Formann
    • 1
  1. 1.Institut für Informatik, Fachbereich MathematikFreie Universität BerlinBerlin 33Germany

Personalised recommendations