Author:
de Berg Mark,de Groot Marko M.,Overmars Mark H.
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference12 articles.
1. Visibility of disjoint polygons;Asano;Algorithmica,1986
2. Computing and verifying depth orders;de Berg;SIAM J. Comput.,1994
3. Better lower bounds on detecting affine and spherical degeneracies;Erickson,1993
4. On visible surface generation by a priori tree structures;Fuchs;Comput. Graph.,1980
5. On a class of O(n2) problems in computational geometry;Gajentaan;Computational Geometry: Theory and Applications,1995
Cited by
18 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Approximating Maximum Independent Set for Rectangles in the Plane;SIAM Journal on Computing;2024-07-23
2. Hardness for triangle problems under even more believable hypotheses: reductions from real APSP, real 3SUM, and OV;Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing;2022-06-09
3. Approximating Maximum Independent Set for Rectangles in the Plane;2021 IEEE 62nd Annual Symposium on Foundations of Computer Science (FOCS);2022-02
4. All non-trivial variants of 3-LDT are equivalent;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06
5. Data structures meet cryptography: 3SUM with preprocessing;Proceedings of the 52nd Annual ACM SIGACT Symposium on Theory of Computing;2020-06-06