Counting Triangulations and Other Crossing-Free Structures via Onion Layers-Reference-Cited by-同舟云学术

Counting Triangulations and Other Crossing-Free Structures via Onion Layers

Published:2015-03-17 Issue:4 Volume:53 Page:675-690
ISSN:0179-5376
Container-title:Discrete & Computational Geometry
language:en
Short-container-title:Discrete Comput Geom

Author:

Alvarez Victor,Bringmann Karl,Curticapean Radu,Ray Saurabh

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/s00454-015-9672-3.pdf

Reference36 articles.

1. Aichholzer, O.: The path of a triangulation. In: Proceedings of the 15th Annual Symposium on Computational Geometry, SoCG ’99, pp. 14–23. ACM Press, New York (1999)

2. Aichholzer, O., Krasser, H.: The point set order type data base: a collection of applications and results. In: Proceedings of the 13th Canadian Conference on Computational Geometry, CCCG ’01, pp. 17–20. Waterloo (2001)

3. Aichholzer, O., Hurtado, F., Noy, M.: A lower bound on the number of triangulations of planar point sets. Comput. Geom. 29(2), 135–145 (2004)

4. Aichholzer, O., Aurenhammer, F., Huemer, C., Vogtenhuber, B.: Gray code enumeration of plane straight-line graphs. Graphs Comb. 23(5), 467–479 (2007)

5. Aichholzer, O., Hackl, T., Huemer, C., Hurtado, F., Krasser, H., Vogtenhuber, B.: On the number of plane geometric graphs. Graphs Comb. 23(1), 67–84 (2007)

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

1. Non-crossing Hamiltonian Paths and Cycles in Output-Polynomial Time;Algorithmica;2024-07-18

2. New estimates for convex layer numbers;Discrete Mathematics;2021-07

3. Counting Polygon Triangulations is Hard;Discrete & Computational Geometry;2020-10-13