{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,19]],"date-time":"2025-01-19T05:22:29Z","timestamp":1737264149611,"version":"3.33.0"},"reference-count":8,"publisher":"Wiley","issue":"1","license":[{"start":{"date-parts":[[2007,3,21]],"date-time":"2007-03-21T00:00:00Z","timestamp":1174435200000},"content-version":"vor","delay-in-days":4097,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Systems &amp; Computers in Japan"],"published-print":{"date-parts":[[1996,1]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>This paper presents a method to construct the Delaunay triangulation for creating a polygon patch model, which is used as a graphic model for applications such as computer graphics and virtual reality. This method is based on the conventional incremental method to construct the Voronoi diagram, but has two characteristics that are especially suitable for a three\u2010dimensional geometric modeling. One of these characteristics is that a point can be removed from the mesh. This feature is useful for the interactive modeling application in which points are often removed and moved. The other is that a line, which lies between two points, can be constrained to be an edge of the mesh. This is necessary for creating an accurate three\u2010dimensional model. Without this feature, the mesh usually obtained has totally different three\u2010dimensional structure from the real object. A process to apply this method to a radial range image is described as well as the details of this method. Experimental results and evaluation of this method are also shown.<\/jats:p>","DOI":"10.1002\/scj.4690270106","type":"journal-article","created":{"date-parts":[[2007,7,8]],"date-time":"2007-07-08T09:20:50Z","timestamp":1183886450000},"page":"58-68","source":"Crossref","is-referenced-by-count":3,"title":["The delaunay triangulation for accurate three\u2010dimensional graphic model"],"prefix":"10.1002","volume":"27","author":[{"given":"Hiroyuki","family":"Yamamoto","sequence":"first","affiliation":[]},{"given":"Shinji","family":"Uchiyama","sequence":"additional","affiliation":[]},{"given":"Hideyuki","family":"Tamura","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2007,3,21]]},"reference":[{"issue":"2","key":"e_1_2_1_2_2","first-page":"351","article-title":"Hierarchical shape representation with adaptive meshes from a range image","volume":"36","author":"Uchiyama S.","year":"1995","journal-title":"Trans. Information Processing Society of Japan"},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"H.TanakaandF.Kishino.Adaptive mesh generation for surface reconstruction: Parallel hierarchical triangulation without discontinuities. In:Proc. of Conf. on Computer Vision and Pattern Recognition pp.88\u201394(1993).","DOI":"10.1109\/CVPR.1993.340974"},{"key":"e_1_2_1_4_2","doi-asserted-by":"crossref","unstructured":"E. L.Bras\u2010Mehlman M.Schmitt O. D.FaugerasandJ. D.Boissonnat.How the Delaunay triangulation can be used for representing stereo data. In:Proc. of International Conf. on Computer Vision pp.54\u201363(1988).","DOI":"10.1109\/CCV.1988.589971"},{"key":"e_1_2_1_5_2","doi-asserted-by":"crossref","unstructured":"H.Hoppe T.DeRose T.Duchamp J.McDonaldandW.Stuetzle.Mesh optimization. In:Proc. of SIGGRAPH pp.19\u201326(1993).","DOI":"10.1145\/166117.166119"},{"issue":"9","key":"e_1_2_1_6_2","first-page":"1067","article-title":"Computational geometry and image analysis \u2010 Concentrated on applications of Voronoi diagrams","volume":"30","author":"Sugihara K.","year":"1989","journal-title":"Jour. Information Processing Society of Japan"},{"issue":"3","key":"e_1_2_1_7_2","first-page":"211","article-title":"An algorithm for the optimum triangulations","volume":"19","author":"Kishimoto K.","year":"1978","journal-title":"Jour. Information Processing Society of Japan"},{"volume-title":"Computational Geometry and Geographical Information Processing","year":"1986","author":"Iri M.","key":"e_1_2_1_8_2"},{"key":"e_1_2_1_9_2","unstructured":"H.InagakiandK.Sugihara.Three\u2010dimensional constrained Delaunay triangulation algorithm.IPS Japan Tech. Rept.AL\u201038\u20106 Technical Report (1994)."}],"container-title":["Systems and Computers in Japan"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fscj.4690270106","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/scj.4690270106","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,18]],"date-time":"2025-01-18T19:56:25Z","timestamp":1737230185000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/scj.4690270106"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1996,1]]},"references-count":8,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1996,1]]}},"alternative-id":["10.1002\/scj.4690270106"],"URL":"https:\/\/doi.org\/10.1002\/scj.4690270106","archive":["Portico"],"relation":{},"ISSN":["0882-1666","1520-684X"],"issn-type":[{"type":"print","value":"0882-1666"},{"type":"electronic","value":"1520-684X"}],"subject":[],"published":{"date-parts":[[1996,1]]}}}