{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:26Z","timestamp":1725664106563},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540589501"},{"type":"electronic","value":"9783540491552"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1995]]},"DOI":"10.1007\/3-540-58950-3_390","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:55:22Z","timestamp":1330275322000},"page":"352-363","source":"Crossref","is-referenced-by-count":4,"title":["Recognizing rectangle of influence drawable graphs (extended abstract)"],"prefix":"10.1007","author":[{"given":"H.","family":"ElGindy","sequence":"first","affiliation":[]},{"given":"G.","family":"Liotta","sequence":"additional","affiliation":[]},{"given":"A.","family":"Lubiw","sequence":"additional","affiliation":[]},{"given":"H.","family":"Meijer","sequence":"additional","affiliation":[]},{"given":"S. H.","family":"Whitesides","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"40_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-349-03521-2","volume-title":"Graph Theory with Applications","author":"J. A. Bondy","year":"1976","unstructured":"J. A. Bondy and U. S. R. Murty. Graph Theory with Applications. Elsevier Science, New York, New York, 1976."},{"key":"40_CR2","unstructured":"P. Bose, W. Lenhart, and G. Liotta. Characterizing Proximity Trees. Algorithmica: Special Issue on Graph Drawing (to appear). Also available as TR-SOCS 93.9, School of Computer Science, McGill Univ., 1993."},{"key":"40_CR3","doi-asserted-by":"crossref","unstructured":"P. Bose, G. Di Battista, W. Lenhart, and G. Liotta. Proximity Constraints and Representable Trees. Proc. GD'94, 1994.","DOI":"10.1007\/3-540-58950-3_389"},{"key":"40_CR4","doi-asserted-by":"crossref","first-page":"417","DOI":"10.1016\/0167-8655(92)90048-5","volume":"13","author":"R. J. Cimikowski","year":"1992","unstructured":"R. J. Cimikowski. Properties of Some Euclidean Proximity Graphs. Patt. Recogn. Letters, 13, 1992, pp. 417\u2013423.","journal-title":"Patt. Recogn. Letters"},{"key":"40_CR5","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1016\/0196-6774(92)90019-9","volume":"13","author":"M. Berg de","year":"1992","unstructured":"M. de Berg, S. Carlsson, and M.H. Overmars. A General Approach to Dominance in the Plane. J. of Algorithms, 13, 1992, pp. 274\u2013296.","journal-title":"J. of Algorithms"},{"key":"40_CR6","unstructured":"G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis. Algorithms for Automatic Graph Drawing: An Annotated Bibliography. Computational Geometry: Theory and Applications (to appear)."},{"key":"40_CR7","unstructured":"G. Di Battista, W. Lenhart, G. Liotta. Proximity Drawability: a Survey. Proc. GD'94, 1994."},{"key":"40_CR8","doi-asserted-by":"crossref","unstructured":"G. Di Battista and L. Vismara. Angles of Planar Triangular Graphs. Proc. STOC '93, 1993, pp. 431\u2013437.","DOI":"10.1145\/167088.167207"},{"key":"40_CR9","unstructured":"M. B. Dillencourt and W. D. Smith. Graph-Theoretical Conditions for Inscribability and Delaunay Realizability. Proc. CCCG'94, 1994, pp.287\u2013292."},{"key":"40_CR10","doi-asserted-by":"crossref","unstructured":"P. Eades and S. Whitesides. The Realization Problem for Euclidean Minimum Spanning Tree is NP-hard. Proc. ACM Symp. on Comp. Geom., pp. 49\u201356, 1994.","DOI":"10.1145\/177424.177507"},{"key":"40_CR11","doi-asserted-by":"crossref","unstructured":"H. de Fraysseix, J. Pach, and R. Pollack. Small Sets Supporting Fary Embeddings of Planar Graphs. Proc. STOC '88, 1988, pp. 426\u2013433.","DOI":"10.1145\/62212.62254"},{"key":"40_CR12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1007\/BF02122694","volume":"10","author":"H. Fraysseix de","year":"1990","unstructured":"H. de Fraysseix, J. Pach, and R. Pollack. How to Draw a Planar Graph on a Grid. Combinatorica, 10, 1990, pp. 41\u201351.","journal-title":"Combinatorica"},{"key":"40_CR13","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1016\/0031-3203(85)90040-8","volume":"18","author":"M. Ichino","year":"1985","unstructured":"M. Ichino, J. Sklansky. The Relative Neighborhood Graph for Mixed Feature Variables. Patt. Recogn., 18, 1985, pp. 161\u2013167.","journal-title":"Patt. Recogn."},{"key":"40_CR14","doi-asserted-by":"crossref","first-page":"1502","DOI":"10.1109\/5.163414","volume":"80","author":"J. W. Jaromczyk","year":"1992","unstructured":"J. W. Jaromczyk and G. T. Toussaint. Relative Neighborhood Graphs and Their Relatives. Proc. of the IEEE, 80, 1992, pp. 1502\u20131517.","journal-title":"Proc. of the IEEE"},{"key":"40_CR15","doi-asserted-by":"crossref","unstructured":"G. Kant. Drawing Planar Graphs Using the lmc-ordering. Proc. FOCS '92, 1992, pp. 101\u2013110.","DOI":"10.1109\/SFCS.1992.267814"},{"key":"40_CR16","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/B978-0-444-87806-9.50013-X","volume-title":"Computational Geometry","author":"D. G. Kirkpatrick","year":"1985","unstructured":"D. G. Kirkpatrick and J. D. Radke. A Framework for Computational Morphology. Computational Geometry, ed. G. T. Toussaint, Elsevier, Amsterdam, 1985, pp. 217\u2013248."},{"key":"40_CR17","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1111\/j.1538-4632.1969.tb00615.x","volume":"1","author":"P. M. Lankford","year":"1969","unstructured":"P. M. Lankford. Regionalization: Theory and Alternative Algorithms. Geogr. Anal., 1, 1969, pp. 196\u2013212.","journal-title":"Geogr. Anal."},{"key":"40_CR18","unstructured":"A. Lubiw and N. Sleumer. All Maximal Outerplanar Graphs are Relative Neighborhood Graphs. Proc. CCCG '93, 1993, pp. 198\u2013203."},{"key":"40_CR19","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1111\/j.1538-4632.1980.tb00031.x","volume":"12","author":"D. W. Matula","year":"1980","unstructured":"D. W. Matula and R. R. Sokal. Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane. Geogr. Anal., 12, 1980, pp. 205\u2013222.","journal-title":"Geogr. Anal."},{"key":"40_CR20","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1016\/0196-6774(88)90028-4","volume":"9","author":"M. H. Overmars","year":"1988","unstructured":"M. H. Overmars and D. Wood. On Rectangular Visibility. Journal of Algorithms, 9, 1988, pp. 372\u2013390.","journal-title":"Journal of Algorithms"},{"key":"40_CR21","doi-asserted-by":"crossref","unstructured":"M. S. Paterson and F.F. Yao, On Nearest-Neighbor Graphs. Proc. ICALP '92, 1992, pp. 416\u2013426.","DOI":"10.1007\/3-540-55719-9_93"},{"key":"40_CR22","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: an Introduction","author":"F. P. Preparata","year":"1985","unstructured":"F. P. Preparata and M. I. Shamos, Computational Geometry: an Introduction. Springer-Verlag, New York, 1985."},{"key":"40_CR23","first-page":"105","volume-title":"Computational Morphology","author":"J. D. Radke","year":"1988","unstructured":"J. D. Radke. On the Shape of a Set of Points. Computational Morphology, ed. G. T. Toussaint, Elsevier, Amsterdam, 1988, pp. 105\u2013136."},{"key":"40_CR24","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1016\/0031-3203(80)90066-7","volume":"12","author":"G. T. Toussaint","year":"1980","unstructured":"G. T. Toussaint. The Relative Neighborhood Graph of a Finite Planar Set. Patt. Recogn., 12, 1980, pp. 261\u2013268.","journal-title":"Patt. Recogn."}],"container-title":["Lecture Notes in Computer Science","Graph Drawing"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-58950-3_390.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:24:54Z","timestamp":1605648294000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_390"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_390","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}