Proximity Drawings

University of Perugia 4.

[1]  Michiel H. M. Smid,et al.  Approximating the average stretch factor of geometric graphs , 2010, J. Comput. Geom..

[2]  Giuseppe Di Battista,et al.  Angles of planar triangular graphs , 1993, STOC '93.

[3]  Bryan L. Shader,et al.  Sphere-of-influence graphs using the sup-norm , 2000 .

[4]  T. S. Michael,et al.  Sphere of Influence Graphs and the L-metric , 2003, Discret. Appl. Math..

[5]  Claire Mathieu.  Some problems in computational geometry , 2005, Algorithmica.

[6]  Rom Pinchasi,et al.  On locally Delaunay geometric graphs , 2004, SCG '04.

[7]  Boting Yang,et al.  Triangulations without Minimum-Weight Drawing , 2000, CIAC.

[8]  Michael A. Soss.  On the size of the euclidean sphere of influence graph , 1999, CCCG.

[9]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[10]  D. Kirkpatrick,et al.  A Framework for Computational Morphology , 1985 .

[11]  Kokichi Sugihara,et al.  Topology-Oriented Implementation—An Approach to Robust Geometric Algorithms , 2000, Algorithmica.

[12]  T. S. Michael,et al.  Sphere of influence graphs: Edge density and clique size , 1994 .

[13]  Clyde L. Monma,et al.  Transitions in geometric minimum spanning trees , 1991, SCG '91.

[14]  Shin-Ichi Nakano,et al.  Convex Grid Drwaings of Four-Connected Plane Graphs , 2000, ISAAC.

[15]  Ioannis G. Tollis,et al.  Area Requirement of Gabriel Drawings , 1996, CIAC.

[16]  Michael B. Dillencourt,et al.  An upper bound on the shortness exponent of inscribable polytopes , 1989, J. Comb. Theory, Ser. B.

[17]  Joachim Gudmundsson,et al.  Fast Greedy Algorithms for Constructing Sparse Geometric Spanners , 2002, SIAM J. Comput..

[18]  Godfried T. Toussaint,et al.  Relative neighborhood graphs and their relatives , 1992, Proc. IEEE.

[19]  Godfried T. Toussaint,et al.  Geometric proximity graphs for improving nearest neighbor methods in instance-based learning and data mining , 2005, Int. J. Comput. Geom. Appl..

[20]  Prosenjit Bose,et al.  Online Routing in Triangulations , 1999, SIAM J. Comput..

[21]  M. Sharir,et al.  Sphere-of-influence graphs in higher dimensions , 1994 .

[22]  Xiang-Yang Li,et al.  Proximity Structures for Geometric Graphs , 2003, Int. J. Comput. Geom. Appl..

[23]  Frank Harary,et al.  Abstract sphere-of-influence graphs , 1993 .

[24]  Jeffrey S. Salowe,et al.  Low-degree minimum spanning trees , 1995, Discret. Comput. Geom..

[25]  Giuseppe Liotta,et al.  The drawability problem for minimum weight triangulations , 2002, Theor. Comput. Sci..

[26]  R. Sokal,et al.  A New Statistical Approach to Geographic Variation Analysis , 1969 .

[27]  James A. King.  Realization of Degree 10 Minimum Spanning Trees in 3-Space , 2006, CCCG.

[28]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[29]  Ge Xia,et al.  On Spanners and Lightweight Spanners of Geometric Graphs , 2010, SIAM J. Comput..

[30]  David Eppstein.  The diameter of nearest neighbor graphs , 1992 .

[31]  Remco C. Veltkamp.  Boundaries through Scattered Points of Unknown Density , 1995, CVGIP Graph. Model. Image Process..

[32]  David G. Kirkpatrick,et al.  On the Spanning Ratio of Gabriel Graphs and beta-skeletons , 2002, LATIN.

[33]  Godfried T. Toussaint,et al.  The relative neighbourhood graph of a finite planar set , 1980, Pattern Recognit..

[34]  Emilio Di Giacomo,et al.  The Approximate Rectangle of Influence Drawability Problem , 2013, Algorithmica.

[35]  Günter Rote,et al.  Minimum-weight triangulation is NP-hard , 2006, JACM.

[36]  Giuseppe Liotta,et al.  Voronoi Drawings of Trees , 1999, Graph Drawing.

[37]  Anna Lubiw,et al.  Maximal Outerplanar Graphs Are Relative Neighbourhood Graphs , 1993, CCCG.

[38]  Giuseppe Liotta,et al.  Proximity Drawings of Outerplanar Graphs , 1996, GD.

[39]  Éric Fusy,et al.  Transversal structures on triangulations: A combinatorial study and straight-line drawings , 2006, Discret. Math..

[40]  Boting Yang,et al.  Maximum Weight Triangulation and Graph Drawing , 1999, Inf. Process. Lett..

[41]  Marco Chiesa,et al.  On the area requirements of Euclidean minimum spanning trees , 2014, Comput. Geom..

[42]  Boris Aronov,et al.  Witness Rectangle Graphs , 2011, Graphs Comb..

[43]  Jianbo Qian,et al.  A Linear-Time Approximation Scheme for Maximum Weight Triangulation of Convex Polygons , 2004, Algorithmica.

[44]  Giuseppe Liotta,et al.  The strength of weak proximity , 1995, J. Discrete Algorithms.

[45]  Joachim Gudmundsson,et al.  Higher order Delaunay triangulations , 2000, Comput. Geom..

[46]  Henk Meijer,et al.  Rectangle of Influence Drawings of Graphs without Filled 3-Cycles , 1999, Graph Drawing.

[47]  Michael B. Dillencourt,et al.  A linear-time algorithm for testing the inscribability of trivalent polyhedra , 1992, SCG '92.

[48]  John D. Radke,et al.  On the Shape of a Set of Points , 1988 .

[49]  D. Avis,et al.  REMARKS ON THE SPHERE OF INFLUENCE GRAPH , 1985 .

[50]  Prosenjit Bose,et al.  Some properties of higher order delaunay and gabriel graphs , 2010, CCCG.

[51]  Sue Whitesides,et al.  The Three Dimensional Logic Engine , 2004, GD.

[52]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[53]  T. S. Michael,et al.  Sphere of influence graphs in general metric spaces , 1999 .

[54]  Herbert Edelsbrunner,et al.  The union of balls and its dual shape , 1993, SCG '93.

[55]  Therese C. Biedl,et al.  Open Rectangle-of-Influence Drawings of Non-triangulated Planar Graphs , 2012, Graph Drawing.

[56]  Jennifer C. Hou,et al.  Topology control in heterogeneous wireless networks: problems and solutions , 2004, IEEE INFOCOM 2004.

[57]  Ferran Hurtado,et al.  On crossing numbers of geometric proximity graphs , 2011, Comput. Geom..

[58]  Kurt Mehlhorn,et al.  Checking geometric programs or verification of geometric structures , 1996, SCG '96.

[59]  Paolo Penna,et al.  Proximity drawings in polynomial area and volume , 2004, Comput. Geom..

[60]  Éric Fusy.  Counting d-Polytopes with d+3 Vertices , 2006, Electron. J. Comb..

[61]  G. Toussaint.  A Graph-Theoretical Primal Sketch , 1988 .

[62]  David Eppstein,et al.  On Nearest-Neighbor Graphs , 1992, ICALP.

[63]  P. Erdös,et al.  Geometrical Extrema Suggested by a Lemma of Besicovitch , 1951 .

[64]  C. Wang,et al.  A lower bound for -skeleton belonging to minimum weight triangulations ? ? This work is partially s , 2001 .

[65]  Fabian Kuhn,et al.  Worst-Case optimal and average-case efficient geometric ad-hoc routing , 2003, MobiHoc '03.

[66]  Giri Narasimhan,et al.  Geometric spanner networks , 2007 .

[67]  Michael A. Soss.  The size of the open sphere of influence graph in metric spaces , 1998, CCCG.

[68]  Siu-Wing Cheng,et al.  On beta-skeleton as a subgraph of the minimum weight triangulation , 2001, Theor. Comput. Sci..

[69]  F. McMorris,et al.  Trees that are sphere-of-influence graphs , 1995 .

[70]  Xiang-Yang Li,et al.  Distributed construction of a planar spanner and routing for ad hoc wireless networks , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.

[71]  Md. Saidur Rahman,et al.  Computing beta -Drawings of 2-Outerplane Graphs in Linear Time , 2008, WALCOM.

[72]  Giuseppe Liotta,et al.  Proximity Drawability: a Survey , 1994, Graph Drawing.

[73]  Roderick Urquhart,et al.  Some properties of the planar Euclidean relative neighbourhood graph , 1983, Pattern Recognit. Lett..

[74]  Manabu Ichino,et al.  The relative neighborhood graph for mixed feature variables , 1985, Pattern Recognit..

[75]  Ivan Stojmenovic,et al.  Partial Delaunay triangulation and degree limited localized Bluetooth scatternet formation , 2004, IEEE Transactions on Parallel and Distributed Systems.

[76]  M. Iri,et al.  Construction of the Voronoi diagram for 'one million' generators in single-precision arithmetic , 1992, Proc. IEEE.

[77]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[78]  David R. Wood,et al.  Partitions and Coverings of Trees by Bounded-Degree Subtrees , 2010, ArXiv.

[79]  Stavros S. Cosmadakis,et al.  The Complexity of Minimizing Wire Lengths in VLSI Layouts , 1987, Inf. Process. Lett..

[80]  Giuseppe Liotta,et al.  The rectangle of influence drawability problem , 1996, Comput. Geom..

[81]  Huaming Zhang,et al.  On Open Rectangle-of-Influence Drawings of Planar Graphs , 2009, COCOA.

[82]  Jianbo Qian,et al.  Progress on maximum weight triangulation , 2006, Comput. Geom..

[83]  Remco C. Veltkamp,et al.  Closed Object Boundaries from Scattered Points , 1994, Lecture Notes in Computer Science.

[84]  Michael B. Dillencourt,et al.  Toughness and Delaunay triangulations , 1987, SCG '87.

[85]  Takao Nishizeki,et al.  Open Rectangle-of-Influence Drawings of Inner Triangulated Plane Graphs , 2006, Graph Drawing.

[86]  Takao Nishizeki,et al.  Rectangle-of-Influence Drawings of Four-Connected Plane Graphs , 2005, APVIS.

[87]  Michael Kaufmann,et al.  Polynomial area bounds for MST embeddings of trees , 2011, Comput. Geom..

[88]  Gert Vegter,et al.  In handbook of discrete and computational geometry , 1997 .

[89]  Ioannis G. Tollis,et al.  Graph Drawing , 1994, Lecture Notes in Computer Science.

[90]  Lui Sha,et al.  Design and analysis of an MST-based topology control algorithm , 2003, IEEE Transactions on Wireless Communications.

[91]  Huaming Zhang,et al.  On Open Rectangle-of-Influence and Rectangular Dual Drawings of Plane Graphs , 2009, Discret. Math. Algorithms Appl..

[92]  Md. Saidur Rahman,et al.  Computing beta-Drawings of 2-Outerplane Graphs , 2007, WALCOM.

[93]  Xiang-Yang Li,et al.  Localized Delaunay Triangulation with Application in Ad Hoc Wireless Networks , 2003, IEEE Trans. Parallel Distributed Syst..

[94]  Prosenjit Bose,et al.  Proximity Constraints and Representable Trees , 1994, Graph Drawing.

[95]  Xiang-Yang Li,et al.  Applications of Computational Geometry in Wireless Networks , 2004 .

[96]  D. Matula,et al.  Properties of Gabriel Graphs Relevant to Geographic Variation Research and the Clustering of Points in the Plane , 2010 .

[97]  Michael B. Dillencourt,et al.  Finding Hamiltonian Cycles in Delaunay Triangulations Is NP-complete , 1996, Discret. Appl. Math..

[98]  Prosenjit Bose,et al.  Characterizing proximity trees , 1996, Algorithmica.

[99]  Jirí Matousek,et al.  Relative neighborhood graphs in three dimensions , 1992, SODA '92.

[100]  Giuseppe Liotta,et al.  Drawing Outerplanar Minimum Weight Triangulations , 1996, Inf. Process. Lett..

[101]  Giuseppe Liotta,et al.  A note on alpha-drawable k-trees , 2008, CCCG.

[102]  Shin-Ichi Nakano,et al.  Convex Grid Drawings of Four-connected Plane Graphs , 2006, Int. J. Found. Comput. Sci..

[103]  Boris Aronov,et al.  Witness (Delaunay) graphs , 2010, Comput. Geom..

[104]  Michael B. Dillencourt,et al.  Graph-theoretical conditions for inscribability and Delaunay realizability , 1996, Discret. Math..

[105]  Giuseppe Liotta,et al.  Computing Proximity Drawings of Trees in the 3-Dimemsional Space , 1995, WADS.

[106]  Xiang-Yang Li,et al.  A unified energy-efficient topology for unicast and broadcast , 2005, MobiCom '05.

[107]  Carey E. Priebe,et al.  Classification Using Class Cover Catch Digraphs , 2003, J. Classif..

[108]  Philip M. Lankford.  Regionalization: Theory and Alternative Algorithms , 2010 .

[109]  E. R. Reifenberg.  A Problem on Circles , 1948 .

[110]  Michael B. Dillencourt,et al.  Realizability of Delaunay Triangulations , 1990, Inf. Process. Lett..

[111]  Giuseppe Liotta,et al.  Checking the convexity of polytopes and the planarity of subdivisions , 1998, Comput. Geom..

[112]  Maarten Löffler,et al.  Almost all Delaunay triangulations have stretch factor greater than pi/2 , 2011, Comput. Geom..

[113]  Kevin Q. Brown,et al.  Voronoi Diagrams from Convex Hulls , 1979, Inf. Process. Lett..