[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/378583.378709acmconferencesArticle/Chapter ViewAbstractPublication PagessocgConference Proceedingsconference-collections
Article

A sum of squares theorem for visibility

Published: 01 June 2001 Publication History

Abstract

We present a new and simpler method to implement in constant amortized time the flip operation of the so-called “Greedy Flip Algorithm”, an optimal algorithm to compute the visibility complex of a collection of pairwise disjoint bounded convex sets of constant complexity. The method relies on a “sum of squares” like theorem for visibility complexes stated and proved in this paper. (The sum of squares theorem for an arrangement of lines states that the average value of the square of the number of vertices of a face of the arrangement is a $O(1)$.)

References

[1]
P. K. Agarwal, J. Basch, L. J. Guibas, J. Hershberger, and L. Zhang. Deformable free space tiling for kinetic collision detection. In Proc. 4th Workshop Algorithmic Found. Robot., 2000. To appear.
[2]
B. Aronov, J. Matousek, and M. Sharir. On the sum of squares of cell complexities in hyperplane arrangements. J. Combin. Theory Ser. A, 65:311-321, 1994.
[3]
T. Asano, L. J. Guibas, and T. Tokuyama. Walking on an arrangement topologically. Internat. J. Comput. Geom. Appl., 4:123-151, 1994.
[4]
B. Chazelle, L. J. Guibas, and D. T. Lee. The power of geometric duality. BIT, 25:76-90, 1985.
[5]
F. Cho and D. Forsyth. Interactive ray tracing with the visibility complex. Computers and Graphics (Special Issue on Visibility - Techniques and Applications), 23(5):703-717, 1999.
[6]
R. Connelly, E. D. Demaine, and G. Rote. Straightening polygonal arcs and convexifying polygonal cycles. In Proc. 41th Annu. IEEE Sympos. Found. Comput. Sci., pages 432-442, 2000.
[7]
F. Durand, G. Drettakis, and C. Puech. Fast and accurate hierarchical radiosity using global visibility. ACM Transactions on Graphics, 18(2):128-170, 1999.
[8]
H. Edelsbrunner and L. J. Guibas. Topologically sweeping an arrangement. J. Comput. Syst. Sci., 38:165-194, 1989. Corrigendum in 42 (1991), 249-251.
[9]
H. Edelsbrunner, J. O'Rourke, and R. Seidel. Constructing arrangements of lines and hyperplanes with applications. SIAM J. Comput., 15:341-363, 1986.
[10]
S. K. Ghosh. On recognizing and characterizing visibility graphs of simple polygons. Discrete Comput. Geom., 17:143-162, 1997.
[11]
D. Kirkpatrick, J. Snoeyink, and B. Speckmann. Kinetic collision detection for simple polygons. In Proc. 16th Annu. ACM Sympos. Comput. Geom., pages 322-329, 2000.
[12]
J. O'Rourke and I. Streinu. Vertex-edge pseudo-visibility graphs: Characterization and recognition. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 119-128, 1997.
[13]
M. Pocchiola and G. Vegter. Pseudo-triangulations: Theory and applications. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 291-300, 1996.
[14]
M. Pocchiola and G. Vegter. Topologically sweeping visibility complexes via pseudo-triangulations. Discrete Comput. Geom., 16:419-453, Dec. 1996.
[15]
M. Pocchiola and G. Vegter. The visibility complex. Internat. J. Comput. Geom. Appl., 6(3):279-308, 1996.
[16]
M. Pocchiola and G. Vegter. On polygonal covers. In B. Chazelle, J. Goodman, and R. Pollack, editors, Advances in Discrete and Computational Geometry, volume 223 of Contemporary Mathematics, pages 257-268. AMS, Providence, 1999.
[17]
S. Riviere, R. Orti, F. Durand, and C. Puech. Using the visibility complex for radiosity computation. In ACM Workshop Appl. Comput. Geom., May 1996.
[18]
I. Streinu. A combinatorial approach to planar non-colliding robot arm motion planning. In Proc. 41th Annu. IEEE Sympos. Found. Comput. Sci., pages 443-453, 2000.

Cited By

View all
  • (2006)The predicates for the Voronoi diagram of ellipsesProceedings of the twenty-second annual symposium on Computational geometry10.1145/1137856.1137891(227-236)Online publication date: 5-Jun-2006

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
SCG '01: Proceedings of the seventeenth annual symposium on Computational geometry
June 2001
326 pages
ISBN:158113357X
DOI:10.1145/378583
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 2001

Permissions

Request permissions for this article.

Check for updates

Qualifiers

  • Article

Conference

SoCG01

Acceptance Rates

SCG '01 Paper Acceptance Rate 39 of 106 submissions, 37%;
Overall Acceptance Rate 625 of 1,685 submissions, 37%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)1
  • Downloads (Last 6 weeks)0
Reflects downloads up to 14 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2006)The predicates for the Voronoi diagram of ellipsesProceedings of the twenty-second annual symposium on Computational geometry10.1145/1137856.1137891(227-236)Online publication date: 5-Jun-2006

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media