Mantas, Ioannis; Savić, Marko; Schrezenmaier, Hendrik New variants of perfect non-crossing matchings. (English) Zbl 07497528 Mudgal, Apurva (ed.) et al., Algorithms and discrete applied mathematics. 7th international conference, CALDAM 2021, Rupnagar, India, February 11–13, 2021. Proceedings. Lect. Notes Comput. Sci. 12601, 151-164 (2021). MSC: 68Wxx PDF BibTeX XML Cite \textit{I. Mantas} et al., Lect. Notes Comput. Sci. 12601, 151--164 (2021; Zbl 07497528) Full Text: DOI arXiv
Jingyu, Pei; Xiaoping, Wang; Leen, Zhang An approach to computing multipoint inversion and multiray surface intersection on parametric surface. (English) Zbl 1435.65039 Math. Probl. Eng. 2019, Article ID 3790762, 12 p. (2019). MSC: 65D18 65D17 PDF BibTeX XML Cite \textit{P. Jingyu} et al., Math. Probl. Eng. 2019, Article ID 3790762, 12 p. (2019; Zbl 1435.65039) Full Text: DOI
Biniaz, Ahmad; Bose, Prosenjit; Eppstein, David; Maheshwari, Anil; Morin, Pat; Smid, Michiel Spanning trees in multipartite geometric graphs. (English) Zbl 1410.68280 Algorithmica 80, No. 11, 3177-3191 (2018). MSC: 68R10 05C85 68U05 PDF BibTeX XML Cite \textit{A. Biniaz} et al., Algorithmica 80, No. 11, 3177--3191 (2018; Zbl 1410.68280) Full Text: DOI arXiv
Cheilaris, Panagiotis; Khramtcova, Elena; Langerman, Stefan; Papadopoulou, Evanthia A randomized incremental algorithm for the Hausdorff Voronoi diagram of non-crossing clusters. (English) Zbl 1352.68265 Algorithmica 76, No. 4, 935-960 (2016). MSC: 68U05 68W20 PDF BibTeX XML Cite \textit{P. Cheilaris} et al., Algorithmica 76, No. 4, 935--960 (2016; Zbl 1352.68265) Full Text: DOI arXiv
Davoodi, Mansoor; Mohades, Ali; Sheikhi, Farnaz; Khanteimouri, Payam Data imprecision under \(\lambda\)-geometry model. (English) Zbl 1360.68873 Inf. Sci. 295, 126-144 (2015). MSC: 68U05 PDF BibTeX XML Cite \textit{M. Davoodi} et al., Inf. Sci. 295, 126--144 (2015; Zbl 1360.68873) Full Text: DOI
Toutant, Jean-Luc; Andres, Eric; Roussillon, Tristan Digital circles, spheres and hyperspheres: from morphological models to analytical characterizations and topological properties. (English) Zbl 1291.68412 Discrete Appl. Math. 161, No. 16-17, 2662-2677 (2013). MSC: 68U05 52B55 52A01 PDF BibTeX XML Cite \textit{J.-L. Toutant} et al., Discrete Appl. Math. 161, No. 16--17, 2662--2677 (2013; Zbl 1291.68412) Full Text: DOI
Díaz-Báñez, J. M.; López, M. A.; Mora, M.; Seara, C.; Ventura, I. Fitting a two-joint orthogonal chain to a point set. (English) Zbl 1209.65019 Comput. Geom. 44, No. 3, 135-147 (2011). MSC: 65D10 PDF BibTeX XML Cite \textit{J. M. Díaz-Báñez} et al., Comput. Geom. 44, No. 3, 135--147 (2011; Zbl 1209.65019) Full Text: DOI Link
Yang, Chenglei; Qi, Meng; Meng, Xiangxu; Li, Xueqing; Wang, Jiaye A new fast algorithm for computing the distance between two disjoint convex polygons based on Voronoi diagram. (English) Zbl 1145.65307 J. Zhejiang Univ., Sci. A 7, No. 9, 1522-1529 (2006). MSC: 65D18 68U05 68P10 PDF BibTeX XML Cite \textit{C. Yang} et al., J. Zhejiang Univ., Sci. A 7, No. 9, 1522--1529 (2006; Zbl 1145.65307) Full Text: DOI
Ahn, Hee-Kap; Brass, Peter; Cheong, Otfried; Na, Hyeon-Suk; Shin, Chan-Su; Vigneron, Antoine Inscribing an axially symmetric polygon and other approximation algorithms for planar convex sets. (English) Zbl 1137.68608 Comput. Geom. 33, No. 3, 152-164 (2006). MSC: 68U05 52B55 68P05 68W25 PDF BibTeX XML Cite \textit{H.-K. Ahn} et al., Comput. Geom. 33, No. 3, 152--164 (2006; Zbl 1137.68608) Full Text: DOI
Ma, Ying Liang; Hewitt, W. T. Point inversion and projection for nurbs curve and surface: control polygon approach. (English) Zbl 1069.65558 Comput. Aided Geom. Des. 20, No. 2, 79-99 (2003). MSC: 65D18 65D17 PDF BibTeX XML Cite \textit{Y. L. Ma} and \textit{W. T. Hewitt}, Comput. Aided Geom. Des. 20, No. 2, 79--99 (2003; Zbl 1069.65558) Full Text: DOI
Bespamyatnikh, S. An efficient algorithm for the three-dimensional diameter problem. (English) Zbl 0996.68217 Discrete Comput. Geom. 25, No. 2, 235-255 (2001). MSC: 68U05 65D18 PDF BibTeX XML Cite \textit{S. Bespamyatnikh}, Discrete Comput. Geom. 25, No. 2, 235--255 (2001; Zbl 0996.68217) Full Text: DOI
Kirkpatrick, David; Snoeyink, Jack Computing constrained shortest segments: Butterfly wingspans in logarithmic time. (English) Zbl 1020.52013 Int. J. Comput. Geom. Appl. 9, No. 1, 53-62 (1999). MSC: 52B55 65D18 90C30 PDF BibTeX XML Cite \textit{D. Kirkpatrick} and \textit{J. Snoeyink}, Int. J. Comput. Geom. Appl. 9, No. 1, 53--62 (1999; Zbl 1020.52013) Full Text: DOI
Lê, Ngoc-Minh On determining optimal strategies in pursuit games in the plane. (English) Zbl 0911.90376 Theor. Comput. Sci. 197, No. 1-2, 203-234 (1998). MSC: 91A24 93C85 91A23 PDF BibTeX XML Cite \textit{N.-M. Lê}, Theor. Comput. Sci. 197, No. 1--2, 203--234 (1998; Zbl 0911.90376) Full Text: DOI
de Berg, Mark; de Groot, Marko; Overmars, Mark New results on binary space partitions in the plane. (English) Zbl 0883.68129 Comput. Geom. 8, No. 6, 317-333 (1997). MSC: 68U05 PDF BibTeX XML Cite \textit{M. de Berg} et al., Comput. Geom. 8, No. 6, 317--333 (1997; Zbl 0883.68129) Full Text: DOI
McAllister, M.; Kirkpatrick, D.; Snoeyink, J. A compact piecewise-linear Voronoi diagram for convex sites in the plane. (English) Zbl 0840.68119 Discrete Comput. Geom. 15, No. 1, 73-105 (1996). MSC: 68U05 PDF BibTeX XML Cite \textit{M. McAllister} et al., Discrete Comput. Geom. 15, No. 1, 73--105 (1996; Zbl 0840.68119) Full Text: DOI
Ong, Chong Jin Computation of penetration between smooth convex objects in three-dimensional space. (English) Zbl 0881.68129 J. Rob. Syst. 13, No. 5, 303-315 (1996). MSC: 68U10 70B15 68U99 PDF BibTeX XML Cite \textit{C. J. Ong}, J. Rob. Syst. 13, No. 5, 303--315 (1996; Zbl 0881.68129) Full Text: DOI
Seong, Kyoung A.; Leekwang, Hyung \(\alpha\)-kernel problem with fuzzy visibility. (English) Zbl 0859.68122 Fuzzy Sets Syst. 73, No. 3, 377-388 (1995). MSC: 68U10 68U05 PDF BibTeX XML Cite \textit{K. A. Seong} and \textit{H. Leekwang}, Fuzzy Sets Syst. 73, No. 3, 377--388 (1995; Zbl 0859.68122) Full Text: DOI
Kirkpatrick, David; Snoeyink, Jack Computing common tangents without a separating line. (English) Zbl 1502.68328 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, 183-193 (1995). MSC: 68U05 PDF BibTeX XML Cite \textit{D. Kirkpatrick} and \textit{J. Snoeyink}, Lect. Notes Comput. Sci. 955, 183--193 (1995; Zbl 1502.68328) Full Text: DOI
de Berg, Mark; de Groot, Marko; Overmars, Mark New results on binary space partitions in the plane (extended abstract). (English) Zbl 1502.68312 Schmidt, Erik M. (ed.) et al., Algorithm theory – SWAT ’94. 4th Scandinavian workshop on algorithm theory, Aarhus, Denmark, July 6–8, 1994. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 824, 61-72 (1994). MSC: 68U05 PDF BibTeX XML Cite \textit{M. de Berg} et al., Lect. Notes Comput. Sci. 824, 61--72 (1994; Zbl 1502.68312) Full Text: DOI
Houle, Michael E. Algorithms for weak and wide separation of sets. (English) Zbl 0797.68160 Discrete Appl. Math. 45, No. 2, 139-159 (1993). MSC: 68U05 68Q25 68T10 PDF BibTeX XML Cite \textit{M. E. Houle}, Discrete Appl. Math. 45, No. 2, 139--159 (1993; Zbl 0797.68160) Full Text: DOI
Dobkin, David; Hershberger, John; Kirkpatrick, David; Suri, Subhash Computing the intersection-depth to polyhedra. (English) Zbl 0797.68162 Algorithmica 9, No. 6, 518-533 (1993). MSC: 68U05 68Q25 PDF BibTeX XML Cite \textit{D. Dobkin} et al., Algorithmica 9, No. 6, 518--533 (1993; Zbl 0797.68162) Full Text: DOI
Bartling, Frank; Hinrichs, Klaus A plane-sweep algorithm for finding a closest pair among convex planar objects. (English) Zbl 1493.68367 Finkel, A. (ed.) et al., STACS 92. Theoretical aspects of computer science. Proceedings of the 9th annual symposium, Cachan, France, February 13–15, 1992. Berlin: Springer. Lect. Notes Comput. Sci. 577, 221-232 (1992). MSC: 68U05 68W40 PDF BibTeX XML Cite \textit{F. Bartling} and \textit{K. Hinrichs}, Lect. Notes Comput. Sci. 577, 221--232 (1992; Zbl 1493.68367) Full Text: DOI
Bhattacharya, B.; Toussaint, G. Computing shortest transversals. (English) Zbl 0723.68102 Computing 46, No. 2, 93-119 (1991). MSC: 68U05 68N20 52A30 52A10 PDF BibTeX XML Cite \textit{B. Bhattacharya} and \textit{G. Toussaint}, Computing 46, No. 2, 93--119 (1991; Zbl 0723.68102) Full Text: DOI
Atallah, Mikhail J.; Goodrich, Michael T. Parallel algorithms for some functions of two convex polygons. (English) Zbl 0648.68061 Algorithmica 3, No. 4, 535-548 (1988). MSC: 68Q25 52A10 PDF BibTeX XML Cite \textit{M. J. Atallah} and \textit{M. T. Goodrich}, Algorithmica 3, No. 4, 535--548 (1988; Zbl 0648.68061) Full Text: DOI
Lirov, Yuval k-th shortest collision-free path planning. (English) Zbl 0627.90088 Appl. Math. Lett. 1, No. 1, 61-64 (1988). MSC: 90C35 PDF BibTeX XML Cite \textit{Y. Lirov}, Appl. Math. Lett. 1, No. 1, 61--64 (1988; Zbl 0627.90088) Full Text: DOI
Rohnert, Hans Shortest paths in the plane with convex polygonal obstacles. (English) Zbl 0607.68052 Inf. Process. Lett. 23, 71-76 (1986). MSC: 68R99 68Q25 PDF BibTeX XML Cite \textit{H. Rohnert}, Inf. Process. Lett. 23, 71--76 (1986; Zbl 0607.68052) Full Text: DOI
Chin, Francis; Sampson, Jeffrey; Wang, Cao An A unifying approach for a class of problems in the computational geometry of polygons. (English) Zbl 0618.68039 Visual Comput. 1, 124-132 (1985). MSC: 68Q25 52A10 51M20 PDF BibTeX XML Cite \textit{F. Chin} et al., Visual Comput. 1, 124--132 (1985; Zbl 0618.68039) 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, 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