Author:
Hoffmann Michael,Tóth Csaba D.
Subject
Computational Mathematics,Computational Theory and Mathematics,Control and Optimization,Geometry and Topology,Computer Science Applications
Reference20 articles.
1. Can visibility graphs be represented compactly?;Agarwal;Discrete Comput. Geom.,1994
2. Visibility in the plane;Asano,2000
3. Every set of disjoint line segments admits a binary tree;Bose;Discrete Comput. Geom.,2001
4. Open problems from CCCG'99;Demaine,2000
5. Planar segment visibility graphs;Everett;Computational Geometry,2000
Cited by
20 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Circumscribing Polygons and Polygonizations for Disjoint Line Segments;Discrete & Computational Geometry;2022-01-31
2. Reconstruction of Weakly Simple Polygons from Their Edges;International Journal of Computational Geometry & Applications;2018-06
3. Minimum Spanning Tree of Line Segments;Lecture Notes in Computer Science;2018
4. Computational Geometry Column 61;ACM SIGACT News;2015-06-04
5. Compatible spanning trees;Computational Geometry;2014-07