×

Found 46 Documents (Results 1–46)

Piecewise-linear farthest-site Voronoi diagrams. (English) Zbl 07788603

Ahn, Hee-Kap (ed.) et al., 32nd international symposium on algorithms and computation, ISAAC 2021, Fukuoka, Japan, December 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 212, Article 30, 11 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Certified approximation algorithms for the Fermat point and \(n\)-ellipses. (English) Zbl 07740909

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 54, 19 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

The Voronoi diagram of rotating rays with applications to floodlight illumination. (English) Zbl 07740860

Mutzel, Petra (ed.) et al., 29th annual European symposium on algorithms. ESA 2021, Lisbon, Portugal (virtual conference), September 6–8, 2021. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 204, Article 5, 16 p. (2021).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI arXiv

Farthest color Voronoi diagrams: complexity and algorithms. (English) Zbl 07600782

Kohayakawa, Yoshiharu (ed.) et al., Latin 2020: theoretical informatics. 14th Latin American symposium, São Paulo, Brazil, January 5–8, 2021. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 12118, 283-295 (2020).
MSC:  68Qxx 68Rxx 68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Unbounded regions of high-order Voronoi diagrams of lines and segments in higher dimensions. (English) Zbl 07650295

Lu, Pinyan (ed.) et al., 30th international symposium on algorithms and computation, ISAAC 2019, Shanghai University of Finance and Economics, Shanghai, China, December 8–11, 2019. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 149, Article 62, 15 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

On selecting leaves with disjoint neighborhoods in embedded trees. (English) Zbl 1522.68652

Pal, Sudebkumar Prasant (ed.) et al., Algorithms and discrete applied mathematics. 5th international conference, CALDAM 2019, Kharagpur, India, February 14–16, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11394, 189-200 (2019).
MSC:  68U05 05C05 68W40
PDFBibTeX XMLCite
Full Text: DOI

Deletion in abstract Voronoi diagrams in expected linear time. (English) Zbl 1489.68362

Speckmann, Bettina (ed.) et al., 34th international symposium on computational geometry, SoCG 2018, June 11–14, 2018, Budapest, Hungary. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 99, Article 50, 14 p. (2018).
MSC:  68U05 68W20 68W40
PDFBibTeX XMLCite
Full Text: DOI

Randomized incremental construction for the Hausdorff Voronoi diagram revisited and extended. (English) Zbl 1434.68608

Cao, Yixin (ed.) et al., Computing and combinatorics. 23rd international conference, COCOON 2017, Hong Kong, China, August 3–5, 2017. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10392, 321-332 (2017).
MSC:  68U05 68W20
PDFBibTeX XMLCite
Full Text: DOI

Stabbing circles for sets of segments in the plane. (English) Zbl 1453.68202

Kranakis, Evangelos (ed.) et al., LATIN 2016: theoretical informatics. 12th Latin American symposium, Ensenada, Mexico, April 11–15, 2016. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9644, 290-305 (2016).
MSC:  68U05 52B55 68Q25
PDFBibTeX XMLCite
Full Text: DOI Link

Linear-time algorithms for the farthest-segment Voronoi diagram and related tree structures. (English) Zbl 1472.68206

Elbassioni, Khaled (ed.) et al., Algorithms and computation. 26th international symposium, ISAAC 2015, Nagoya, Japan, December 9–11, 2015. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 9472, 404-414 (2015).
MSC:  68U05 68W05 68W40
PDFBibTeX XMLCite
Full Text: DOI

A randomized divide and conquer algorithm for higher-order abstract Voronoi diagrams. (English) Zbl 1432.68492

Ahn, Hee-Kap (ed.) et al., Algorithms and computation. 25th international symposium, ISAAC 2014, Jeonju, Korea, December 15–17, 2014. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8889, 27-37 (2014).
MSC:  68U05 68W20
PDFBibTeX XMLCite
Full Text: DOI

Implementing the \(L _{ \infty }\) segment Voronoi diagram in CGAL and applying in VLSI pattern analysis. (English) Zbl 1434.65009

Hong, Hoon (ed.) et al., Mathematical software – ICMS 2014. 4th international congress, Seoul, South Korea, August 5–9, 2014. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 8592, 198-205 (2014).
MSC:  65-04 65D18 68U05
PDFBibTeX XMLCite
Full Text: DOI

A randomized incremental approach for the Hausdorff Voronoi diagram of non-crossing clusters. (English) Zbl 1343.68259

Pardo, Alberto (ed.) et al., LATIN 2014: theoretical informatics. 11th Latin American symposium, Montevideo, Uruguay, March 31 – April 4, 2014. Proceedings. Berlin: Springer (ISBN 978-3-642-54422-4/pbk). Lecture Notes in Computer Science 8392, 96-107 (2014).
MSC:  68U05 68W20
PDFBibTeX XMLCite
Full Text: DOI arXiv

Map of geometric minimal cuts for general planar embedding. (English) Zbl 1406.68125

Widmayer, Peter (ed.) et al., Combinatorial optimization and applications. 7th international conference, COCOA 2013, Chengdu, China, December 12–14, 2013. Proceedings. Berlin: Springer (ISBN 978-3-319-03779-0/pbk). Lecture Notes in Computer Science 8287, 238-249 (2013).
MSC:  68U05 05C10 68R10
PDFBibTeX XMLCite
Full Text: DOI

On the complexity of higher order abstract Voronoi diagrams. (English) Zbl 1336.68259

Fomin, Fedor V. (ed.) et al., Automata, languages, and programming. 40th international colloquium, ICALP 2013, Riga, Latvia, July 8–12, 2013, Proceedings, Part I. Berlin: Springer (ISBN 978-3-642-39205-4/pbk). Lecture Notes in Computer Science 7965, 208-219 (2013).
MSC:  68U05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

On the farthest line-segment Voronoi diagram. (English) Zbl 1260.68421

Chao, Kun-Mao (ed.) et al., Algorithms and computation. 23rd international symposium, ISAAC 2012, Taipei, Taiwan, December 19–21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-35260-7/pbk). Lecture Notes in Computer Science 7676, 187-196 (2012).
MSC:  68U05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

On higher order Voronoi diagrams of line segments. (English) Zbl 1260.68422

Chao, Kun-Mao (ed.) et al., Algorithms and computation. 23rd international symposium, ISAAC 2012, Taipei, Taiwan, December 19–21, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-35260-7/pbk). Lecture Notes in Computer Science 7676, 177-186 (2012).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

An output-sensitive approach for the \(L _{1}/L _{ \infty }\) \(k\)-nearest-neighbor Voronoi diagram. (English) Zbl 1346.68232

Demetrescu, Camil (ed.) et al., Algorithms – ESA 2011. 19th annual European symposium, Saarbrücken, Germany, September 5–9, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-23718-8/pbk). Lecture Notes in Computer Science 6942, 70-81 (2011).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Computing the map of geometric minimal cuts. (English) Zbl 1272.52033

Dong, Yingfei (ed.) et al., Algorithms and computation. 20th international symposium, ISAAC 2009, Honolulu, Hawaii, USA, December 16–18, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-10630-9/pbk). Lecture Notes in Computer Science 5878, 244-254 (2009).
MSC:  52B55 05C85 68Q25
PDFBibTeX XMLCite
Full Text: DOI

The higher order Hausdorff Voronoi diagram and VLSI critical area extraction for via-blocks. (English) Zbl 1325.52017

Sugihara, Kokichi (ed.) et al., Voronoï’s impact on modern science. Book 4, Volume 2. Proceedings of the 5th international symposium on Voronoi diagrams in science and engineering, ISVD-2008, Kyiv, Ukraine, September 22–28, 2008. Kyiv: Institute of Mathematics, NAS of Ukraine (ISBN 978-966-02-4890-8/pbk; 978-966-02-4892-2/set). 181-191 (2008).
MSC:  52C45 68U05
PDFBibTeX XMLCite

Higher order Voronoi diagrams of segments for VLSI critical area extraction. (English) Zbl 1193.68271

Tokuyama, Takeshi (ed.), Algorithms and computation. 18th international symposium, ISAAC 2007, Sendai, Japan, December 17–19, 2007. Proceedings. Berlin: Springer (ISBN 978-3-540-77118-0/pbk). Lecture Notes in Computer Science 4835, 716-727 (2007).
MSC:  68U05 52B55 68M07
PDFBibTeX XMLCite
Full Text: DOI

On the Hausdorff Voronoi diagram of point clusters in the plane. (English) Zbl 1278.68315

Dehne, Frank (ed.) et al., Algorithms and data structures. 8th international workshop, WADS 2003, Ottawa, Ontario, Canada, July 30 – August 1, 2003. Proceedings. Berlin: Springer (ISBN 3-540-40545-3/pbk). Lect. Notes Comput. Sci. 2748, 439-450 (2003).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

The min-max Voronoi diagram of polygons and applications in VLSI manufacturing. (English) Zbl 1019.68612

Bose, Prosenjit (ed.) et al., Algorithms and computation. 13th international symposium, ISAAC 2002, Vancouver, BC, Canada, November 21-23, 2002. Proceedings. Berlin: Springer. Lect. Notes Comput. Sci. 2518, 511-522 (2002).
MSC:  68U05 68W05 68U07
PDFBibTeX XMLCite
Full Text: Link

Efficient computation of the geodesic Voronoi diagram of points in a simple polygon (extended abstract). (English) Zbl 1512.68421

Spirakis, Paul (ed.), Algorithms – ESA ’95. 3rd annual European symposium, Corfu, Greece, September 25–27, 1995. Proceedings. Berlin: Springer-Verlag. Lect. Notes Comput. Sci. 979, 238-251 (1995).
MSC:  68U05 68W40
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Year of Publication

all top 3

Main Field

all top 3

Software