AnO(n logn) algorithm for computing the link center of a simple polygon-Reference-Cited by-同舟云学术

AnO(n logn) algorithm for computing the link center of a simple polygon

Published:1992-08 Issue:2 Volume:8 Page:131-152
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Djidjev Hristo N.,Lingas Andrzej,Sack Jörg-Rüdiger

Publisher

Springer Science and Business Media LLC

Subject

Computational Theory and Mathematics,Discrete Mathematics and Combinatorics,Geometry and Topology,Theoretical Computer Science

Link

http://link.springer.com/content/pdf/10.1007/BF02293040.pdf

Reference17 articles.

1. A. V. Aho, J. E. Hopcroft, and J. D. Ullman,The Design and Analysis of Computer Algorithms, Addison-Wesley, Reading, MA, 1974.

2. L. Alexandrov, H. Djidjev, and J.-R. Sack, Finding a central link segment of a simple polygon inO(n logn) time, Technical Report TR-89-7, Bulgarian Academy of Sciences, May 1989; also Technical Report SCS-TR-163, School of Computer Science, Carleton University.

3. L. Alexandrov, H. Djidjev, and J.-R. Sack, Finding the external link center of a simple polygon, unpublished manuscript, April 1990.

4. B. Chazelle, A theorem on polygon cutting with applications,Proc. 23rd Annual IEEE Symp. on Foundations of Computer Science, 1982, pp. 339–349.

5. B. Chazelle, Triangulating a simple polygon in linear time,Proc. 31st Annual IEEE Symposium on Foundations of Computer Science, 1990, pp. 220–230.

Cited by 29 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Rectilinear link diameter and radius in a rectilinear polygonal domain;Computational Geometry;2021-01

2. An Optimal Algorithm for Minimum-Link Rectilinear Paths in Triangulated Rectilinear Domains;Algorithmica;2018-05-04

3. $$\beta $$-Stars or On Extending a Drawing of a Connected Subgraph;Lecture Notes in Computer Science;2018

4. A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon;Discrete & Computational Geometry;2016-07-11

5. Computing the L1 geodesic diameter and center of a simple polygon in linear time;Computational Geometry;2015-08