Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments-Reference-Cited by-同舟云学术

Approximation Algorithms for Finding a Minimum Perimeter Polygon Intersecting a Set of Line Segments

Published:2009 Issue: Volume: Page:363-374
ISSN:0302-9743
Container-title:Lecture Notes in Computer Science
language:
Short-container-title:

Author:

Hassanzadeh Farzad,Rappaport David

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/978-3-642-03367-4_32

Reference16 articles.

1. Aurenhammer, F., Drysdale, R.L.S., Krasser, H.: Farthest line segment Voronoi diagrams. Information Processing Letters 100(6), 220–225 (2006)

2. Bhattacharya, B., Toussaint, G.: Computing shortest transversals. In: Proc. 18th Internat. Colloq. Automat. Lang. Program., pp. 649–660. Springer, Heidelberg (1991)

3. Burkard, R.E., Rote, G., Yao, E.Y., Yu, Z.L.: Shortest polygonal paths in space. Computing 45, 5–68 (1990)

4. Chan, T.M.: Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete and Computational Geometry 16, 36–368 (1996)

5. Czyzowicz, J., Egyed, P., Everett, H., Rappaport, D., Shermer, T.C., Souvaine, D.L., Toussaint, G.T., Urrutia, J.: The aquarium keeper’s problem. In: Symp. on Discrete Algorithms (SODA), pp. 459–464 (1999)

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

1. An Efficient Algorithm for Finding the Minimum Perimeter Convex Hull of Disjoint Segments;Proceedings of the 2nd International Conference on Computer Science and Application Engineering - CSAE '18;2018

2. The Minimum Perimeter Convex Hull of a Given Set of Disjoint Segments;Advances in Intelligent Systems and Computing;2017-11-12

3. New results on stabbing segments with a polygon;Computational Geometry;2015-01

4. New Results on Stabbing Segments with a Polygon;Lecture Notes in Computer Science;2013

5. The maximal distance between imprecise point objects;Fuzzy Sets and Systems;2011-05