乐胖代购免代理版

{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:08:15Z","timestamp":1725664095053},"publisher-location":"Berlin, Heidelberg","reference-count":36,"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_388","type":"book-chapter","created":{"date-parts":[[2012,2,26]],"date-time":"2012-02-26T16:54:56Z","timestamp":1330275296000},"page":"328-339","source":"Crossref","is-referenced-by-count":18,"title":["Proximity drawability: A survey extended abstract"],"prefix":"10.1007","author":[{"given":"Giuseppe","family":"Battista","sequence":"first","affiliation":[]},{"given":"William","family":"Lenhart","sequence":"additional","affiliation":[]},{"given":"Giuseppe","family":"Liotta","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,6,1]]},"reference":[{"key":"38_CR1","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/0925-7721(92)90017-M","volume":"2","author":"P. K. Agarwal","year":"1992","unstructured":"P. K. Agarwal and J. Matou\u0161ek. Relative Neighbourhood Graphs in Three Dimensions. Computational Geometry: Theory and application, 2, 1992, pp. 1\u201314.","journal-title":"Computational Geometry: Theory and application"},{"key":"38_CR2","unstructured":"P. Bose, G. Di Battista, W. Lenhart, and G. Liotta. Proximity Constraints and Representable Trees. Proc. of GD94."},{"key":"38_CR3","unstructured":"P. Bose, W. Lenhart, and G. Liotta. Characterizing Proximity Trees. To appear in Algorithmica: Special Issue on Graph Drawing, also available as Tech. Rep. no. SOCS 93.9, School of Computer Science, McGill University."},{"key":"38_CR4","doi-asserted-by":"crossref","unstructured":"B. Chazelle, H. Edelsbrunner, L. J. Guibas, J. E. Hershberger, R. Seidel, and M. Sharir. Slimming Down by Adding; Selecting Heavily Covered Points. Proc. ACM Symp. on Comp. Geom., 1990, pp. 116\u2013127.","DOI":"10.1145\/98524.98551"},{"key":"38_CR5","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. Pattern Recognition Letters, 13, 1992, pp. 417\u2013423.","journal-title":"Pattern Recognition Letters"},{"key":"38_CR6","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. Journal of Algorithms, 13, 1992, pp. 274\u2013296.","journal-title":"Journal of Algorithms"},{"key":"38_CR7","first-page":"793","volume":"7","author":"B. Delaunay","year":"1934","unstructured":"B. Delaunay. Sur la Sphere vide. Bull. Acad. Sci. USSR(VII), 7, 1934, pp. 793\u2013800.","journal-title":"Bull. Acad. Sci. USSR(VII)"},{"key":"38_CR8","unstructured":"G. Di Battista, P. Eades, R. Tamassia and I.G. Tollis. Algorithms for Automatic Graph Drawing: An Annotated Bibliography. To appear in Computational Geometry: Theory and Applications."},{"key":"38_CR9","doi-asserted-by":"crossref","unstructured":"G. Di Battista and L. Vismara. Angles of Planar Triangular Graphs. Proc. ACM Symposium on Theory of Computing, 1993, pp. 431\u2013437.","DOI":"10.1145\/167088.167207"},{"key":"38_CR10","doi-asserted-by":"crossref","first-page":"283","DOI":"10.1016\/0020-0190(90)90210-O","volume":"33","author":"M. B. Dillencourt","year":"1990","unstructured":"M. B. Dillencourt. Realizability of Delaunay Triangulations. Information Proc. Letters, 33, 1990, pp. 283\u2013287.","journal-title":"Information Proc. Letters"},{"key":"38_CR11","doi-asserted-by":"crossref","first-page":"575","DOI":"10.1007\/BF02187810","volume":"5","author":"M. B. Dillencourt","year":"1990","unstructured":"M. B. Dillencourt. Toughness and Delaunay Triangulations. Discrete and Computational Geometry, 5, 1990, pp.575\u2013601.","journal-title":"Discrete and Computational Geometry"},{"key":"38_CR12","unstructured":"M. B. Dillencourt and W. D. Smith. Graph-Theoretical Conditions for Inscribability and Delaunay Realizability. Proc. CCCG '94, 1994, pp. 287\u2013292."},{"key":"38_CR13","doi-asserted-by":"crossref","unstructured":"P. Eades and S. Whitesides. The Realization Problem for Euclidean Minimum Spanning Trees is NP-hard. Proc. ACM Symposium on Computational Geometry, 1994, pp. 49\u201356.","DOI":"10.1145\/177424.177507"},{"key":"38_CR14","unstructured":"H. ElGindy, G. Liotta, A. Lubiw, H. Meijer, and S.H. Whitesides. Recognizing Rectangle of Influence Drawable Graphs. Proc. of GD94."},{"key":"38_CR15","doi-asserted-by":"crossref","first-page":"54","DOI":"10.2307\/2412323","volume":"18","author":"K. R. Gabriel","year":"1969","unstructured":"K. R. Gabriel and R. R. Sokal. A New Statistical Approach to Geographical Analysis. Systematic Zoology, 18, 1969, pp. 54\u201364.","journal-title":"Systematic Zoology"},{"key":"38_CR16","doi-asserted-by":"crossref","unstructured":"F. Harary. Graph Theory. Addison-Wesley Pub. Comp.1969.","DOI":"10.21236\/AD0705364"},{"key":"38_CR17","volume-title":"A Guide to the Theory of NP-Completeness","author":"M. Garey","year":"1979","unstructured":"M. Garey and D. Johnson. A Guide to the Theory of NP-Completeness. W. H. Freeman and Co., New York, 1979."},{"key":"38_CR18","doi-asserted-by":"crossref","first-page":"170","DOI":"10.1016\/0196-6774(89)90011-4","volume":"10","author":"R.H. Guting","year":"1989","unstructured":"R.H. Guting, O. Nurmi, and T. Ottmann. Fast Algorithms for Direct Enclosures and Direct Dominances. Journal of Algorithms, 10, 1989, pp.170\u2013186.","journal-title":"Journal of Algorithms"},{"key":"38_CR19","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. Pattern Recognition, 18, 2, 1985, pp. 161\u2013167.","journal-title":"Pattern Recognition"},{"key":"38_CR20","unstructured":"M. S. Jacobson, M. J. Lipman, and F. R. McMorris. Trees that are Sphere-of-Influence Graphs. University of Louisville, Tech. Rep. 0191\/2, 1989."},{"key":"38_CR21","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. Proceedings of the IEEE, 80, 1992, pp. 1502\u20131517.","journal-title":"Proceedings of the IEEE"},{"key":"38_CR22","first-page":"13","volume":"4","author":"J. M. Keil","year":"1994","unstructured":"J. M. Keil Computing a subgraph of the minimum weight triangulation. Computational Geometry: Theory and Applications, 4, 1994, pp. 13\u201326.","journal-title":"Computational Geometry: Theory and Applications"},{"key":"38_CR23","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/B978-0-444-87806-9.50013-X","volume-title":"Computational Geometry, G. T. Toussaint","author":"D. G. Kirkpatrick","year":"1985","unstructured":"D. G. Kirkpatrick and J. D. Radke. A Framework for Computational Morphology. Computational Geometry, G. T. Toussaint, Elsevier, Amsterdam, 1985, pp. 217\u2013248."},{"key":"38_CR24","doi-asserted-by":"crossref","first-page":"196","DOI":"10.1111\/j.1538-4632.1969.tb00615.x","volume":"1","author":"P. M. Lankford","year":"1989","unstructured":"P. M. Lankford. Regionalization: Theory and Alternative Algorithms. Geographical Analysis, 1, 1989, pp. 196\u2013212.","journal-title":"Geographical Analysis"},{"key":"38_CR25","unstructured":"A. Lubiw, and N. Sleumer, All Maximal Outerplanar Graphs are Relative Neighborhood Graphs. Proc. CCCG '93, 1993, pp. 198\u2013203."},{"issue":"3","key":"38_CR26","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. Geographical Analysis, 12, 3, 1980, pp. 205\u2013222.","journal-title":"Geographical Analysis"},{"key":"38_CR27","doi-asserted-by":"crossref","unstructured":"C. Monma and S. Suri. Transitions in Geometric Minimum Spanning Trees. Proc. ACM Symposium on Computational Geometry, 1991, pp. 239\u2013249.","DOI":"10.1145\/109648.109675"},{"key":"38_CR28","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":"38_CR29","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":"38_CR30","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":"38_CR31","doi-asserted-by":"crossref","unstructured":"T.-H. Su and R.-Ch. Chang. The k-Gabriel Graphs and their Applications. Proc. International Symposium, SIGAL '90, 1990, pp. 66\u201375.","DOI":"10.1007\/3-540-52921-7_56"},{"key":"38_CR32","doi-asserted-by":"crossref","first-page":"231","DOI":"10.1016\/0031-3203(91)90065-D","volume":"24","author":"T.-H. Su","year":"1991","unstructured":"T.-H. Su and R.-Ch. Chang. Computing the k-relative neighborhood graphs in Euclidean Plane. Pattern Recognition, 24, 1991, pp.231\u2013239.","journal-title":"Pattern Recognition"},{"key":"38_CR33","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. Pattern Recognition, 12, 1980, pp. 261\u2013268.","journal-title":"Pattern Recognition"},{"key":"38_CR34","first-page":"229","volume-title":"Computational Morphology","author":"G. T. Toussaint","year":"1988","unstructured":"G. T. Toussaint. A Graph-Theoretical Primal Sketch. Computational Morphology, ed. G. T. Toussaint, Elsevier, Amsterdam, 1988, pp. 229\u2013260."},{"key":"38_CR35","doi-asserted-by":"crossref","first-page":"317","DOI":"10.1016\/0167-8655(83)90070-3","volume":"1","author":"R. B. Urquhart","year":"1983","unstructured":"R. B. Urquhart. Some Properties of the Planar Euclidean Relative Neighbourhood Graph. Pattern Recognition Letters, 1, 1983, pp. 317\u2013322.","journal-title":"Pattern Recognition Letters"},{"key":"38_CR36","doi-asserted-by":"crossref","first-page":"227","DOI":"10.1016\/0925-7721(92)90003-B","volume":"1","author":"R. C. Vetkamp","year":"1992","unstructured":"R. C. Vetkamp. The \u03b3-Neighbourhood Graph. Computational Geometry: Theory and Applications, 1, 1992, pp. 227\u2013246.","journal-title":"Computational Geometry: Theory and Applications"}],"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_388.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T21:24:53Z","timestamp":1605648293000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-58950-3_388"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1995]]},"ISBN":["9783540589501","9783540491552"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/3-540-58950-3_388","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1995]]}}}