{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,29]],"date-time":"2025-10-29T03:40:16Z","timestamp":1761709216100},"publisher-location":"Cham","reference-count":10,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319445427"},{"type":"electronic","value":"9783319445434"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-44543-4_5","type":"book-chapter","created":{"date-parts":[[2016,8,8]],"date-time":"2016-08-08T11:49:58Z","timestamp":1470656998000},"page":"55-67","source":"Crossref","is-referenced-by-count":1,"title":["Essential Constraints of Edge-Constrained Proximity Graphs"],"prefix":"10.1007","author":[{"given":"Prosenjit","family":"Bose","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jean-Lou","family":"De Carufel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alina","family":"Shaikhet","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michiel","family":"Smid","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2016,8,9]]},"reference":[{"issue":"1","key":"5_CR1","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/BF01553881","volume":"4","author":"LP Chew","year":"1989","unstructured":"Chew, L.P.: Constrained delaunay triangulations. Algorithmica 4(1), 97\u2013108 (1989)","journal-title":"Algorithmica"},{"issue":"2","key":"5_CR2","doi-asserted-by":"crossref","first-page":"471","DOI":"10.1137\/S0097539795285916","volume":"28","author":"F Chin","year":"1998","unstructured":"Chin, F., Wang, C.A.: Finding the constrained Delaunay triangulation and constrained Voronoi diagram of a simple polygon in linear time. SIAM J. Comput. 28(2), 471\u2013486 (1998)","journal-title":"SIAM J. Comput."},{"issue":"5","key":"5_CR3","doi-asserted-by":"crossref","first-page":"391","DOI":"10.1142\/S0218195903001244","volume":"13","author":"O Devillers","year":"2003","unstructured":"Devillers, O., Estkowski, R., Gandoin, P.-M., Hurtado, F., Ramos, P.A., Sacrist\u00e1n, V.: Minimal set of constraints for 2D constrained Delaunay reconstruction. Int. J. Comput. Geometry Appl. 13(5), 391\u2013398 (2003)","journal-title":"Int. J. Comput. Geometry Appl."},{"issue":"3","key":"5_CR4","doi-asserted-by":"crossref","first-page":"259","DOI":"10.2307\/2412323","volume":"18","author":"KR Gabriel","year":"1969","unstructured":"Gabriel, K.R., Sokal, R.R.: A new statistical approach to geographic variation analysis. Syst. Zool. 18(3), 259\u2013278 (1969)","journal-title":"Syst. Zool."},{"key":"5_CR5","doi-asserted-by":"crossref","unstructured":"Jaromczyk, J.W., Kowaluk, M.: A note on relative neighborhood graphs. In: SoCG, pp. 233\u2013241 (1987)","DOI":"10.1145\/41958.41983"},{"key":"5_CR6","unstructured":"Jaromczyk, J.W., Kowaluk, M., Yao, F.: An optimal algorithm for constructing $$\\beta $$ -skeletons in $$l_p$$ metric. Manuscript (1989)"},{"key":"5_CR7","doi-asserted-by":"crossref","unstructured":"Kirkpatrick, D.G., Radke, J.D.: A framework for computational morphology. In: Computational Geometry, vol. 2, pp. 217\u2013248. Machine Intelligence and Pattern Recognition, North-Holland (1985)","DOI":"10.1016\/B978-0-444-87806-9.50013-X"},{"key":"5_CR8","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1007\/BF02187695","volume":"1","author":"DT Lee","year":"1986","unstructured":"Lee, D.T., Lin, A.K.: Generalized Dalaunay triangualtion for planar graphs. Discrete Comput. Geometry 1, 201\u2013217 (1986)","journal-title":"Discrete Comput. Geometry"},{"key":"5_CR9","doi-asserted-by":"crossref","unstructured":"Sleator, D.D., Tarjan, R.E.: A data structure for dynamic trees. In: STOC, pp. 114\u2013122. ACM (1981)","DOI":"10.1145\/800076.802464"},{"issue":"4","key":"5_CR10","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"GT Toussaint","year":"1980","unstructured":"Toussaint, G.T.: The relative neighbourhood graph of a finite planar set. Pattern Recogn. 12(4), 261\u2013268 (1980)","journal-title":"Pattern Recogn."}],"container-title":["Lecture Notes in Computer Science","Combinatorial Algorithms"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-44543-4_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,24]],"date-time":"2017-06-24T20:11:11Z","timestamp":1498335071000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-44543-4_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319445427","9783319445434"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-44543-4_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}