D’Amore, Fabrizio; Franciosa, Paolo G. A low arithmetic-degree algorithm for computing proximity graphs. (English) Zbl 1403.68316 Int. J. Comput. Geom. Appl. 28, No. 3, 227-253 (2018). MSC: 68U05 68R10 PDF BibTeX XML Cite \textit{F. D'Amore} and \textit{P. G. Franciosa}, Int. J. Comput. Geom. Appl. 28, No. 3, 227--253 (2018; Zbl 1403.68316) Full Text: DOI
Zhao, Fangxia; Wu, Jianjun; Sun, Huijun; Gao, Ziyou; Liu, Ronghui Population-driven urban road evolution dynamic model. (English) Zbl 1364.91120 Netw. Spat. Econ. 16, No. 4, 997-1018 (2016). MSC: 91D10 91D20 PDF BibTeX XML Cite \textit{F. Zhao} et al., Netw. Spat. Econ. 16, No. 4, 997--1018 (2016; Zbl 1364.91120) Full Text: DOI Link
Kowaluk, Mirosław; Majewska, Gabriela \(\beta\)-skeletons for a set of line segments in \(\mathbb R^2\). (English) Zbl 1434.68610 Kosowski, Adrian (ed.) et al., Fundamentals of computation theory. 20th international symposium, FCT 2015, Gdańsk, Poland, August 17–19, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 9210, 65-78 (2015). MSC: 68U05 68Q25 68R10 68W40 PDF BibTeX XML Cite \textit{M. Kowaluk} and \textit{G. Majewska}, Lect. Notes Comput. Sci. 9210, 65--78 (2015; Zbl 1434.68610) Full Text: DOI arXiv
Kowaluk, Mirosław; Majewska, Gabriela New sequential and parallel algorithms for computing the \(\beta\)-spectrum. (English) Zbl 1327.68319 Theor. Comput. Sci. 590, 73-85 (2015). MSC: 68U05 05C10 05C85 68W10 PDF BibTeX XML Cite \textit{M. Kowaluk} and \textit{G. Majewska}, Theor. Comput. Sci. 590, 73--85 (2015; Zbl 1327.68319) Full Text: DOI
Gui, Jinsong; Liu, Anfeng A new distributed topology control algorithm based on optimization of delay and energy in wireless networks. (English) Zbl 1248.68092 J. Parallel Distrib. Comput. 72, No. 8, 1032-1044 (2012). MSC: 68M14 PDF BibTeX XML Cite \textit{J. Gui} and \textit{A. Liu}, J. Parallel Distrib. Comput. 72, No. 8, 1032--1044 (2012; Zbl 1248.68092) Full Text: DOI
Adamatzky, Andrew Growing spanning trees in plasmodium machines. (English) Zbl 1182.92001 Kybernetes 37, No. 2, 258-264 (2008). MSC: 92B05 92C15 68T40 PDF BibTeX XML Cite \textit{A. Adamatzky}, Kybernetes 37, No. 2, 258--264 (2008; Zbl 1182.92001) Full Text: DOI
Urrutia, J. Local solutions for global problems in wireless networks. (English) Zbl 1130.05059 J. Discrete Algorithms 5, No. 3, 395-407 (2007). Reviewer: P. R. Parthasarathy (Karlsruhe) MSC: 05C85 05C69 90B18 90C35 PDF BibTeX XML Cite \textit{J. Urrutia}, J. Discrete Algorithms 5, No. 3, 395--407 (2007; Zbl 1130.05059) Full Text: DOI
Hurtado, Ferran; Liotta, Giuseppe; Meijer, Henk Optimal and suboptimal robust algorithms for proximity graphs. (English) Zbl 1021.65009 Comput. Geom. 25, No. 1-2, 35-49 (2003). Reviewer: Francisco Perez Acosta (La Laguna) MSC: 65D18 PDF BibTeX XML Cite \textit{F. Hurtado} et al., Comput. Geom. 25, No. 1--2, 35--49 (2003; Zbl 1021.65009) Full Text: DOI
Rao, S. V.; Mukhopadhyay, Asish Fast algorithms for computing \(\beta\)-skeletons and their relatives. (English) Zbl 1053.68090 Pattern Recognition 34, No. 11, 2163-2172 (2001). MSC: 68T10 68W05 68U05 PDF BibTeX XML Cite \textit{S. V. Rao} and \textit{A. Mukhopadhyay}, Pattern Recognition 34, No. 11, 2163--2172 (2001; Zbl 1053.68090) Full Text: DOI
Lingas, Andrzej; Mukhopadhyay, Asish A linear-time construction of the relative neighborhood graph within a histogram. (English) Zbl 1502.68335 Akl, Selim G. (ed.) et al., Algorithms and data structures. 4th international workshop, WADS ’95, Kingston, Canada, August 16–18, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 955, 228-238 (1995). MSC: 68U05 68R10 PDF BibTeX XML Cite \textit{A. Lingas} and \textit{A. Mukhopadhyay}, Lect. Notes Comput. Sci. 955, 228--238 (1995; Zbl 1502.68335) Full Text: DOI
Wee, Y. C.; Chaiken, S.; Ravi, S. S. Rectilinear Steiner tree heuristics and minimum spanning tree algorithms using geographic nearest neighbors. (English) Zbl 0823.68108 Algorithmica 12, No. 6, 421-435 (1994). MSC: 68U05 68R10 68W10 PDF BibTeX XML Cite \textit{Y. C. Wee} et al., Algorithmica 12, No. 6, 421--435 (1994; Zbl 0823.68108) Full Text: DOI
Lingas, Andrzej A linear-time construction of the relative neighborhood graph from the Delaunay triangulation. (English) Zbl 0813.68161 Comput. Geom. 4, No. 4, 199-208 (1994). MSC: 68U05 68Q25 PDF BibTeX XML Cite \textit{A. Lingas}, Comput. Geom. 4, No. 4, 199--208 (1994; Zbl 0813.68161) Full Text: DOI
Agarwal, Pankaj K.; Matoušek, Jiří Relative neighborhood graphs in three dimensions. (English) Zbl 0764.68105 Comput. Geom. 2, No. 1, 1-14 (1992). MSC: 68R10 68Q25 68U05 PDF BibTeX XML Cite \textit{P. K. Agarwal} and \textit{J. Matoušek}, Comput. Geom. 2, No. 1, 1--14 (1992; Zbl 0764.68105) Full Text: DOI
Veltkamp, Remco C. The \(\gamma\)-neighborhood graph. (English) Zbl 0748.68089 Comput. Geom. 1, No. 4, 227-246 (1992). MSC: 68U05 05C45 PDF BibTeX XML Cite \textit{R. C. Veltkamp}, Comput. Geom. 1, No. 4, 227--246 (1992; Zbl 0748.68089) Full Text: DOI
Su, Tung-Hsin; Chang, Ruei-Chuan On constructing the relative neighborhood graphs in Euclidean k- dimensional spaces. (English) Zbl 0723.68104 Computing 46, No. 2, 121-130 (1991). MSC: 68U05 68Q25 PDF BibTeX XML Cite \textit{T.-H. Su} and \textit{R.-C. Chang}, Computing 46, No. 2, 121--130 (1991; Zbl 0723.68104) Full Text: DOI
Shute, Gary M.; Deneen, Linda L.; Thomborson, Clark D. An O(n log n) plane-sweep algorithm for \(L_ 1\) and \(L_{\infty}\) Delaunay triangulations. (English) Zbl 0712.68102 Algorithmica 6, No. 2, 207-221 (1991). MSC: 68U05 PDF BibTeX XML Cite \textit{G. M. Shute} et al., Algorithmica 6, No. 2, 207--221 (1991; Zbl 0712.68102) Full Text: DOI
Jaromczyk, Jerzy W.; Kowaluk, Mirosław Constructing the relative neighborhood graph in 3-dimensional Euclidean space. (English) Zbl 0757.05062 Discrete Appl. Math. 31, No. 2, 181-191 (1991). MSC: 05C35 PDF BibTeX XML Cite \textit{J. W. Jaromczyk} and \textit{M. Kowaluk}, Discrete Appl. Math. 31, No. 2, 181--191 (1991; Zbl 0757.05062) Full Text: DOI
Cimikowski, R. J. Coloring certain proximity graphs. (English) Zbl 0705.05032 Comput. Math. Appl. 20, No. 3, 69-82 (1990). Reviewer: J.Fiamčík MSC: 05C15 PDF BibTeX XML Cite \textit{R. J. Cimikowski}, Comput. Math. Appl. 20, No. 3, 69--82 (1990; Zbl 0705.05032) Full Text: DOI
Huang, Nen-Fu A divide-and-conquer algorithm for constructing relative neighborhood graph. (English) Zbl 0696.68059 BIT 30, No. 2, 196-206 (1990). MSC: 68Q25 68R10 68U99 PDF BibTeX XML Cite \textit{N.-F. Huang}, BIT 30, No. 2, 196--206 (1990; Zbl 0696.68059) Full Text: DOI
Wee, Young C.; Chaiken, Seth; Willard, Dan E. On the angle restricted nearest neighbor problem. (English) Zbl 0695.68047 Inf. Process. Lett. 34, No. 2, 71-76 (1990). MSC: 68Q25 68P10 PDF BibTeX XML Cite \textit{Y. C. Wee} et al., Inf. Process. Lett. 34, No. 2, 71--76 (1990; Zbl 0695.68047) Full Text: DOI
Clarkson, Kenneth L. An algorithm for geometric minimum spanning trees requiring nearly linear expected time. (English) Zbl 0682.68042 Algorithmica 4, No. 4, 461-469 (1989). MSC: 68Q25 68R10 68P10 PDF BibTeX XML Cite \textit{K. L. Clarkson}, Algorithmica 4, No. 4, 461--469 (1989; Zbl 0682.68042) Full Text: DOI
Olariu, Stephan A simple linear-time algorithm for computing the ring and MST of unimodal polygons. (English) Zbl 0672.68017 Inf. Process. Lett. 31, No. 5, 243-247 (1989). Reviewer: H.-D.Hecker MSC: 68Q25 68U05 PDF BibTeX XML Cite \textit{S. Olariu}, Inf. Process. Lett. 31, No. 5, 243--247 (1989; Zbl 0672.68017) Full Text: DOI
Devroye, L. The expected size of some graphs in computational geometry. (English) Zbl 0649.68066 Comput. Math. Appl. 15, No. 1, 53-64 (1988). Reviewer: H.Edelsbrunner MSC: 68R10 PDF BibTeX XML Cite \textit{L. Devroye}, Comput. Math. Appl. 15, No. 1, 53--64 (1988; Zbl 0649.68066) Full Text: DOI
Katajainen, J. The region approach for computing relative neighbourhood graphs in the \(L_ p\) metric. (English) Zbl 0628.68055 Computing 40, No. 2, 147-161 (1988). MSC: 68R10 PDF BibTeX XML Cite \textit{J. Katajainen}, Computing 40, No. 2, 147--161 (1988; Zbl 0628.68055) Full Text: DOI
Katajainen, Jyrki; Nevalainen, Olli; Teuhola, Jukka A linear expected-time algorithm for computing planar relative neighbourhood graphs. (English) Zbl 0653.68034 Inf. Process. Lett. 25, 77-86 (1987). MSC: 68Q25 68R10 52A37 PDF BibTeX XML Cite \textit{J. Katajainen} et al., Inf. Process. Lett. 25, 77--86 (1987; Zbl 0653.68034) Full Text: DOI
Katajainen, Jyrki; Nevalainen, Olli An almost naive algorithm for finding relative neighbourhood graphs in \(L_ p\) metrics. (English) Zbl 0634.68030 RAIRO, Inf. Théor. Appl. 21, 199-215 (1987). MSC: 68Q25 68R10 05C35 PDF BibTeX XML Cite \textit{J. Katajainen} and \textit{O. Nevalainen}, RAIRO, Inform. Théor. Appl. 21, 199--215 (1987; Zbl 0634.68030) Full Text: DOI EuDML
Katajainen, Jyrki; Nevalainen, Olli Computing relative neighbourhood graphs in the plane. (English) Zbl 0602.68089 Pattern Recognition 19, 221-228 (1986). Reviewer: N.N.Necula MSC: 68T10 68R10 PDF BibTeX XML Cite \textit{J. Katajainen} and \textit{O. Nevalainen}, Pattern Recognition 19, 221--228 (1986; Zbl 0602.68089) Full Text: DOI
McKenna, Michael; Toussaint, Godfried T. Finding the minimum vertex distance between two disjoint convex polygons in linear time. (English) Zbl 0586.68060 Comput. Math. Appl. 11, 1227-1242 (1985). MSC: 68R99 68Q25 52A10 52Bxx PDF BibTeX XML Cite \textit{M. McKenna} and \textit{G. T. Toussaint}, Comput. Math. Appl. 11, 1227--1242 (1985; Zbl 0586.68060) Full Text: DOI
Toussaint, Godfried T. Complexity, convexity, and unimodality. (English) Zbl 0555.68061 Int. J. Comput. Inform. Sci. 13, 197-217 (1984). MSC: 68T10 68Q25 52A10 51M20 PDF BibTeX XML Cite \textit{G. T. Toussaint}, Int. J. Comput. Inform. Sci. 13, 197--217 (1984; Zbl 0555.68061) Full Text: DOI
Toussaint, G. T. An optimal algorithm for computing the minimum vertex distance between two crossing convex polygons. (English) Zbl 0528.65005 Computing 32, 357-364 (1984). MSC: 65D15 52Bxx PDF BibTeX XML Cite \textit{G. T. Toussaint}, Computing 32, 357--364 (1984; Zbl 0528.65005) Full Text: DOI
O’Rourke, Joseph Computing the relative neighborhood graph in the \(L_ 1\) and L//infinity metrics. (English) Zbl 0486.68063 Pattern Recognition 15, 189-192 (1982). MSC: 68R10 68Q25 PDF BibTeX XML Cite \textit{J. O'Rourke}, Pattern Recognition 15, 189--192 (1982; Zbl 0486.68063) Full Text: DOI