References
References
- Chan TM (1999) A near-line area bound for drawing binary trees In Proceedings of the 10th ACM-SIAM Symposium on Discrete Algorithms 161 168
- Purchase H (1997) Which aesthetic has the greatest effect on human understanding? 5th Symposium on Graph Drawing Rome Italy LNCS 1353, September 18–20, 248 261
- Aichholzer O Aurenhammer F (1996) Straight skeletons for general polygonal figures in the plane Proc. 2nd Ann. Int. Conf. Computing and Combinatorics (COCOON-96). Lecture Notes in Computer Science (LNCS)1090, Springer 117 126
- Aichholzer O Aurenhammer F Alberts D Gartner B (1995) Straight skeletons of simple polygons Proceedings of the 4th International Symposium at LIESMARS-95 Wuhan/China October
- Felkel P Obdrzalek S (1998) Straight skeleton implementation Proceedings of Spring Conference on Computer Graphics ISBN 80-223-0837-4, 210 218 http://www.cgg.cvut.cz/Publications/felkel-sccg-98.ps.gz
- Davidson , R and Harel , D . (1996) . Drawing graphs nicely using simulated annealing . ACM Transactions on Graphics , 15 ( 4 ) : 301 – 331 .
- Chin F Snoeyink J Wang CA (1995) Finding the medial axis of a simple polygon in linear time Proc. 6th Ann. Int. Symp. Algorithms and Computation (ISAAC 95). Lecture Notes in Computer Science 1004 383 391
- Bourke P (1988) Calculating the area and centroid of a polygon http://www.swin.edu.au/astronomy/pbourke/ geometry/polyarea/