{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,29]],"date-time":"2025-08-29T00:03:02Z","timestamp":1756425782219,"version":"3.44.0"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540662273"},{"type":"electronic","value":"9783540485186"}],"license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1999]]},"DOI":"10.1007\/3-540-48518-x_8","type":"book-chapter","created":{"date-parts":[[2007,11,14]],"date-time":"2007-11-14T13:57:15Z","timestamp":1195048635000},"page":"129-144","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Accessing the Internal Organization of Data Structures in the JDSL Library"],"prefix":"10.1007","author":[{"given":"Michael T.","family":"Goodrich","sequence":"first","affiliation":[]},{"given":"Mark","family":"Handy","sequence":"additional","affiliation":[]},{"given":"Beno\u00eet","family":"Hudson","sequence":"additional","affiliation":[]},{"given":"Roberto","family":"Tamassia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2002,4,19]]},"reference":[{"key":"8_CR1","doi-asserted-by":"crossref","unstructured":"R. Baker, M. Boilen, M. T. Goodrich, R. Tamassia, and B. A. Stibel. Testers and visualizers for teaching data structures. In Proc. ACM Symp. Computer Science Education, 1999.","DOI":"10.1145\/299649.299779"},{"key":"8_CR2","unstructured":"J. Beall. Shortest path between two points in a polygon. http:\/\/www.cs.brown.edu\/courses\/cs252\/projects\/jeb\/html\/cs252proj.html."},{"key":"8_CR3","unstructured":"M. Boilen, A. Schwerin, and J. Kloss. Personal communication."},{"key":"8_CR4","volume-title":"Introduction to Algorithms","author":"T. H. Cormen","year":"1990","unstructured":"T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to Algorithms. MIT Press, Cambridge, MA, 1990."},{"key":"8_CR5","unstructured":"A. Fabri et al. The CGAL kernel: A basis for geometric computation. In Proc. 1st ACM Workshop on Appl. Comput. Geom., pages 97\u2013103, May 1996."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"N. Gelfand, M. T. Goodrich, and R. Tamassia. Teaching data structure design patterns. In Proc. ACM Symp. Computer Science Education, 1998.","DOI":"10.1145\/273133.274324"},{"key":"8_CR7","unstructured":"N. Gelfand and R. Tamassia. Algorithmic patterns for graph drawing. In Proc. Graph Drawing\u2019 98. Springer-Verlag, to appear."},{"key":"8_CR8","unstructured":"M. T. Goodrich and J. Kloss. Tiered vector: An e\u00c6cient dynamic array for JDSL. Poster at OOPSLA\u201998."},{"key":"8_CR9","volume-title":"Data Structures and Algorithms in Java","author":"M. T. Goodrich","year":"1998","unstructured":"M. T. Goodrich and R. Tamassia. Data Structures and Algorithms in Java. Wiley, New York, NY, 1998."},{"key":"8_CR10","unstructured":"D. Jackson. The TripartiteEmbeddedPlanarGraph. Manuscript."},{"issue":"1","key":"8_CR11","doi-asserted-by":"publisher","first-page":"96","DOI":"10.1145\/204865.204889","volume":"38","author":"K. Mehlhorn","year":"1995","unstructured":"K. Mehlhorn and S. N\u00e4her. LEDA: a platform for combinatorial and geometric computing. Commun. ACM, 38(1):96\u2013102, 1995.","journal-title":"Commun. ACM"},{"key":"8_CR12","volume-title":"Graph iterators: Decoupling graph structures from algorithms","author":"M. Nissen","year":"1998","unstructured":"M. Nissen. Graph iterators: Decoupling graph structures from algorithms. Diploma thesis, Max-Planck-Institut f\u00fcr Informatik, Univ. Saarlandes, Saarbr\u00fccken, Germany, 1998."},{"key":"8_CR13","volume-title":"The C++ Programming Language","author":"B. Stroustrup","year":"1997","unstructured":"B. Stroustrup. The C++ Programming Language (3rd Edition). Addison-Welsey, Reading, MA, 1997.","edition":"3rd Edition"},{"key":"8_CR14","unstructured":"R. Tamassia, L. Vismara, and J. E. Baker. A case study in algorithm engineering for geometric computing. In Proc. Workshop on Algorithm Engineering, pages 136\u2013145, 1997."},{"key":"8_CR15","doi-asserted-by":"crossref","unstructured":"K. Weihe. Reuse of algorithms: Still a challenge to object-oriented programming. In Proc. OOPSLA\u2019 97, pages 34\u201348, 1997.","DOI":"10.1145\/263698.263704"},{"key":"8_CR16","unstructured":"CS 16 home page. http:\/\/www.cs.brown.edu\/courses\/cs016."},{"key":"8_CR17","unstructured":"ffGraph home page. http:\/\/www.fmi.uni-passau.de\/~friedric\/ffgraph\/main.shtml."},{"key":"8_CR18","unstructured":"Java 1.2 API. http:\/\/java.sun.com\/products\/jdk\/1.2\/docs\/api\/index.html."},{"key":"8_CR19","unstructured":"JDSL home page. http:\/\/www.cs.brown.edu\/cgc\/jdsl."},{"key":"8_CR20","unstructured":"JGL home page. http:\/\/www.objectspace.com\/jgl."},{"key":"8_CR21","unstructured":"LEDA home page. http:\/\/www.mpi-sb.mpg.de\/LEDA."}],"container-title":["Lecture Notes in Computer Science","Algorithm Engineering and Experimentation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-48518-X_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,8,28]],"date-time":"2025-08-28T07:51:27Z","timestamp":1756367487000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/3-540-48518-X_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999]]},"ISBN":["9783540662273","9783540485186"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-48518-x_8","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[1999]]},"assertion":[{"value":"19 April 2002","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}