{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:14:09Z","timestamp":1760440449327},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1987,6,1]],"date-time":"1987-06-01T00:00:00Z","timestamp":549504000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Discrete Comput Geom"],"published-print":{"date-parts":[[1987,6]]},"DOI":"10.1007\/bf02187877","type":"journal-article","created":{"date-parts":[[2005,10,29]],"date-time":"2005-10-29T08:51:54Z","timestamp":1130575914000},"page":"153-174","source":"Crossref","is-referenced-by-count":9,"title":["Storing the subdivision of a polyhedral surface"],"prefix":"10.1007","volume":"2","author":[{"given":"David M.","family":"Mount","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[1987,7,1]]},"reference":[{"key":"BF02187877_CR1","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0196-6774(81)90031-6","volume":"2","author":"N. Chiba","year":"1981","unstructured":"N. Chiba, T. Nishizeki, and N. Saito, A linear 5-coloring algorithm of planar graphs,J. Algorithms 2 (1981), 317\u2013327.","journal-title":"J. Algorithms"},{"key":"BF02187877_CR2","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(82)90120-7","volume":"27","author":"D. Dobkin","year":"1983","unstructured":"D. Dobkin and D. Kirkpatrick, Fast detection of polyhedral intersections,Theoret. Comput. Sci. 27 (1983), 241\u2013253.","journal-title":"Theoret. Comput. Sci."},{"key":"BF02187877_CR3","doi-asserted-by":"crossref","first-page":"455","DOI":"10.1016\/0196-6774(85)90027-6","volume":"6","author":"D. P. Dobkin","year":"1985","unstructured":"D. P. Dobkin and J. I. Munro, Efficient uses of the past,J. Algorithms 6 (1985), 455\u2013465.","journal-title":"J. Algorithms"},{"key":"BF02187877_CR4","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1137\/0215023","volume":"15","author":"H. Edelsbrunner","year":"1986","unstructured":"H. Edelsbrunner, L. J. Guibas, and J. Stolfi, Optimal point location in a montone subdivision,SIAM J. Comput. 15 (1986), 317\u2013340.","journal-title":"SIAM J. Comput."},{"key":"BF02187877_CR5","doi-asserted-by":"crossref","unstructured":"L. Guibas and R. Seidel, Computing convolutions by reciprocal search,Proceedings of the Second Annual ACM Symposium on Computational Geometry, 90\u201399, Yorktown Heights, New York, 1986.","DOI":"10.1145\/10515.10525"},{"key":"BF02187877_CR6","doi-asserted-by":"crossref","first-page":"74","DOI":"10.1145\/282918.282923","volume":"4","author":"L. Guibas","year":"1985","unstructured":"L. Guibas and J. Stolfi, Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams,ACM Trans. Graphics 4 (1985), 74\u2013123.","journal-title":"ACM Trans. Graphics"},{"key":"BF02187877_CR7","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. G. Kirkpatrick","year":"1983","unstructured":"D. G. Kirkpatrick, Optimal search in planar subdivisions,SIAM J. Comput. 12 (1983), 28\u201335.","journal-title":"SIAM J. Comput."},{"key":"BF02187877_CR8","first-page":"595","volume":"6","author":"D. T. Lee","year":"1977","unstructured":"D. T. Lee and F. P. Preparata, Location of a point in a planar subdivision and its applications,SIAM J. Comput. 6 (1977), 595\u2013606.","journal-title":"SIAM J. Comput."},{"key":"BF02187877_CR9","doi-asserted-by":"crossref","unstructured":"J. S. B. Mitchell, D. M. Mount, and C. G. Papdimitriou, The discrete geodesic problem,SIAM J. Comput., to appear.","DOI":"10.1137\/0216045"},{"key":"BF02187877_CR10","doi-asserted-by":"crossref","unstructured":"D. M. Mount, On Finding Shortest Paths on Convex Polyhedra, Technical Report 1495, University of Maryland, 1985.","DOI":"10.21236\/ADA166246"},{"key":"BF02187877_CR11","doi-asserted-by":"crossref","unstructured":"D. M. Mount, Voronoi Diagrams on the Surface of a Polyhedron, Technical Report 1496, University of Maryland, 1985.","DOI":"10.21236\/ADA166220"},{"key":"BF02187877_CR12","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(78)90051-8","volume":"7","author":"D. E. Muller","year":"1978","unstructured":"D. E. Muller and F. P. Preparata, Finding the intersection of two convex polyhedra,Theoret. Comput. Sci. 7 (1978), 217\u2013236.","journal-title":"Theoret. Comput. Sci."},{"key":"BF02187877_CR13","doi-asserted-by":"crossref","first-page":"473","DOI":"10.1137\/0210035","volume":"10","author":"F. P. Preparata","year":"1981","unstructured":"F. P. Preparata, A new approach to planar point location,SIAM J. Comput. 10 (1981), 473\u2013482.","journal-title":"SIAM J. Comput."},{"key":"BF02187877_CR14","doi-asserted-by":"crossref","unstructured":"M. I. Shamos and D. Hoey, Closest-point problems,Proceedings of the 16th IEEE Foundations of Computer Science Symposium, 151\u2013162, 1975.","DOI":"10.1109\/SFCS.1975.8"},{"key":"BF02187877_CR15","doi-asserted-by":"crossref","first-page":"448","DOI":"10.1137\/0214034","volume":"14","author":"M. Sharir","year":"1985","unstructured":"M. Sharir, Intersection and closest-pair problems for a set of planar discs,SIAM J. Comput. 14 (1985), 448\u2013468.","journal-title":"SIAM J. Comput."},{"key":"BF02187877_CR16","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1137\/0215014","volume":"15","author":"M. Sharir","year":"1986","unstructured":"M. Sharir and A. Schorr, On shortest paths in polyhedral spaces,SIAM J. Comput. 15 (1986), 193\u2013215.","journal-title":"SIAM J. Comput."}],"container-title":["Discrete & Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187877.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02187877\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02187877","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,10]],"date-time":"2020-04-10T15:21:54Z","timestamp":1586532114000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02187877"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,6]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,6]]}},"alternative-id":["BF02187877"],"URL":"https:\/\/doi.org\/10.1007\/bf02187877","relation":{},"ISSN":["0179-5376","1432-0444"],"issn-type":[{"value":"0179-5376","type":"print"},{"value":"1432-0444","type":"electronic"}],"subject":[],"published":{"date-parts":[[1987,6]]}}}