Author:
Rote Günter,Woeginger Gerhard,Zhu Binhai,Wang Zhengyan
Subject
Computer Science Applications,Information Systems,Signal Processing,Theoretical Computer Science
Reference3 articles.
1. Constructing arrangements of lines and hyperplanes with applications;Edelsbrunner;SIAM J. Comput.,1986
2. D. Eppstein, M. Overmars, G. Rote and G. Woeginger, Finding minimum area k-gons, Discrete Comput. Geom., to appear.
3. On a triangle counting problem;Khuller;Inform. Process. Lett.,1990
Cited by
8 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Enumerating Empty and Surrounding Polygons;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2023-09-01
2. Empty Squares in Arbitrary Orientation Among Points;Algorithmica;2022-07-25
3. Faster counting empty convex polygons in a planar point set;Information Processing Letters;2022-04
4. Counting Non-Convex 5-Holes in a Planar Point Set;Symmetry;2022-01-05
5. Counting Convex and Non-Convex 4-Holes in a Point Set;IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences;2021-09-01