On-line convex planarity testing
- 1 January 1995
- book chapter
- Published by Springer Nature
- p. 242-255
- https://doi.org/10.1007/3-540-59071-4_52
Abstract
No abstract availableKeywords
This publication has 24 references indexed in Scilit:
- Angles of planar triangular graphsPublished by Association for Computing Machinery (ACM) ,1993
- Separator based sparsification for dynamic planar graph algorithmsPublished by Association for Computing Machinery (ACM) ,1993
- Area-efficient upward tree drawingsPublished by Association for Computing Machinery (ACM) ,1993
- Maintenance of a minimum spanning forest in a dynamic plane graphJournal of Algorithms, 1992
- A framework for dynamic graph drawingPublished by Association for Computing Machinery (ACM) ,1992
- How to draw a planar graph on a gridCombinatorica, 1990
- The architecture of Diagram ServerPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1990
- On-line graph algorithms with SPQR-treesPublished by Springer Nature ,1990
- Incremental planarity testingPublished by Institute of Electrical and Electronics Engineers (IEEE) ,1989
- Drawing plane graphs nicelyActa Informatica, 1985