{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T13:31:39Z","timestamp":1725543099881},"publisher-location":"Berlin, Heidelberg","reference-count":11,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540369257"},{"type":"electronic","value":"9783540369264"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11809678_22","type":"book-chapter","created":{"date-parts":[[2006,8,15]],"date-time":"2006-08-15T13:41:33Z","timestamp":1155649293000},"page":"196-204","source":"Crossref","is-referenced-by-count":5,"title":["Restricted Mesh Simplification Using Edge Contractions"],"prefix":"10.1007","author":[{"given":"Mattias","family":"Andersson","sequence":"first","affiliation":[]},{"given":"Joachim","family":"Gudmundsson","sequence":"additional","affiliation":[]},{"given":"Christos","family":"Levcopoulos","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"22_CR1","doi-asserted-by":"crossref","first-page":"135","DOI":"10.1016\/j.comgeo.2003.07.001","volume":"27","author":"S. Cheng","year":"2004","unstructured":"Cheng, S., Dey, T., Poon, S.: Hierarchy of Surface Models and Irreducible Triangulations. Computational Geometry Theory and Applications (CGTA)\u00a027, 135\u2013150 (2004)","journal-title":"Computational Geometry Theory and Applications (CGTA)"},{"key":"22_CR2","doi-asserted-by":"crossref","unstructured":"de Berg, M., Magillo, K.T.G.: On Levels of Detail in Terrains. In: Proc. ACM Symposium on Computational Geometry, pp. 26\u201327 (1995)","DOI":"10.1145\/220279.220334"},{"key":"22_CR3","doi-asserted-by":"crossref","unstructured":"De Floriani, L., Magillo, P., Puppo, E.: Building and Traversing a Surface at Variable Resolution. In: Proc. IEEE Visualization 1997, pp. 103\u2013110 (1997)","DOI":"10.1109\/VISUAL.1997.663865"},{"key":"22_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/3-540-46648-7_19","volume-title":"Graph Drawing","author":"C.A. Duncan","year":"1999","unstructured":"Duncan, C.A., Goodrich, M.T., Kobourov, S.G.: Planarity-Preserving Clustering and Embedding for Large Planar Graphs. In: Kratochv\u00edl, J. (ed.) GD 1999. LNCS, vol.\u00a01731, pp. 186\u2013196. Springer, Heidelberg (1999)"},{"key":"22_CR5","unstructured":"Garland, M.: Multiresolution Modelling: Survey and Future Opportunities. In: Eurographics 1999, State of the Art Report (STAR) (1999)"},{"key":"22_CR6","doi-asserted-by":"crossref","unstructured":"Gumhold, S., Borodin, P., Klein, R.: Intersection Free Simplification. In: Proc. 4th Israel-Korea Bi-National Conference on Geometric Modeling and Computer Graphics, pp. 11\u201316 (2003)","DOI":"10.1142\/S0218654303000097"},{"key":"22_CR7","doi-asserted-by":"crossref","unstructured":"Heckbert, P., Garland, M.: Surface Simplification Using Quadric Error Metrics. In: Proc. SIGGRAPH 1997, pp. 209\u2013216 (1997)","DOI":"10.1145\/258734.258849"},{"key":"22_CR8","unstructured":"Heckbert, P., Garland, M.: Survey of Polygonal Surface Simplification Algorithms. In: Multiresolution Surface Modelling Course, SIGGRAPH 1997 (1997)"},{"key":"22_CR9","doi-asserted-by":"crossref","unstructured":"Hoppe, H.: Progressive Meshes. In: Proc. SIGGRAPH 1996, pp. 99\u2013108 (1996)","DOI":"10.1145\/237170.237216"},{"key":"22_CR10","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D.G. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.G.: Optimal Search in Planar Subdivisions. SIAM Journal of Computing\u00a012, 28\u201335 (1983)","journal-title":"SIAM Journal of Computing"},{"key":"22_CR11","doi-asserted-by":"crossref","unstructured":"Xia, J.C., El-Sana, J., Varshney, A.: Dynamic View-Dependent Simplification for Polygonal Models. In: Proc. IEEE Visualization 1996, pp. 327\u2013334 (1996)","DOI":"10.1109\/VISUAL.1996.568126"}],"container-title":["Lecture Notes in Computer Science","Computing and Combinatorics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11809678_22.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:13:40Z","timestamp":1605644020000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11809678_22"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540369257","9783540369264"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/11809678_22","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}