×

Found 91 Documents (Results 1–91)

33rd international symposium on algorithms and computation (ISAAC 2022), Seoul, Korea, December 19–21, 2022. (English) Zbl 1502.68019

LIPIcs – Leibniz International Proceedings in Informatics 248. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik (ISBN 978-3-95977-258-7). xx, 67 articles, not consecutively paged, electronic only, open access (2022).
MSC:  68-06 68Wxx 00B25
PDFBibTeX XMLCite
Full Text: DOI Link

Empty squares in arbitrary orientation among points. (English) Zbl 07760142

Cabello, Sergio (ed.) et al., 36th international symposium on computational geometry, SoCG 2020, Zürich, Switzerland (virtual conference), June 23–26, 2020. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 164, Article 13, 17 p. (2020).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Minimum-width double-strip and parallelogram annulus. (English) Zbl 07650258

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 25, 14 p. (2019).
MSC:  68Wxx
PDFBibTeX XMLCite
Full Text: DOI

Maximum-width empty square and rectangular annulus. (English) Zbl 1434.68598

Das, Gautam K. (ed.) et al., WALCOM: algorithms and computation. 13th international conference, WALCOM 2019, Guwahati, India, February 27 – March 2, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11355, 69-81 (2019).
MSC:  68U05 68W40 90B80
PDFBibTeX XMLCite
Full Text: DOI arXiv

The reverse Kakeya problem. (English) Zbl 1491.52004

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 6, 13 p. (2018).
MSC:  52A10
PDFBibTeX XMLCite
Full Text: DOI

Gap-planar graphs. (English) Zbl 1503.68203

Frati, Fabrizio (ed.) et al., Graph drawing and network visualization. 25th international symposium, GD 2017, Boston, MA, USA, September 25–27, 2017. Revised selected papers. Cham: Springer. Lect. Notes Comput. Sci. 10692, 531-545 (2018).
MSC:  68R10 68Q25
PDFBibTeX XMLCite
Full Text: DOI arXiv

Minimum-width annulus with outliers: circular, square, and rectangular cases. (English) Zbl 1498.68354

Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 12th international conference, WALCOM 2018, Dhaka, Bangladesh, March 3–5, 2018. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 10755, 44-55 (2018).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Shortcuts for the circle. (English) Zbl 1457.68278

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 9, 13 p. (2017).
MSC:  68U05 68R10
PDFBibTeX XMLCite
Full Text: DOI

Faster algorithms for growing prioritized disks and rectangles. (English) Zbl 1457.68272

Okamoto, Yoshio (ed.) et al., 28th international symposium on algorithms and computation, ISAAC 2017, December 9–12, 2017, Phuket, Thailand. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 92, Article 3, 13 p. (2017).
PDFBibTeX XMLCite
Full Text: DOI arXiv

\(L_1\) geodesic farthest neighbors in a simple polygon and related problems. (English) Zbl 1398.68611

Seok-Hee Hong (ed.), 27th international symposium on algorithms and computation, ISAAC 2016, Sydney, Australia, December 12–14, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-026-2). LIPIcs – Leibniz International Proceedings in Informatics 64, Article 14, 12 p. (2016).
MSC:  68U05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Approximating convex shapes with respect to symmetric difference under homotheties. (English) Zbl 1387.68281

Fekete, Sándor (ed.) et al., 32nd international symposium on computational geometry, SoCG’16, Boston, MA, USA, June 14–17, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-009-5). LIPIcs – Leibniz International Proceedings in Informatics 51, Article 63, 15 p. (2016).
PDFBibTeX XMLCite
Full Text: DOI

Computing the \(L_1\) geodesic diameter and center of a polygonal domain. (English) Zbl 1388.68280

Ollinger, Nicolas (ed.) et al., 33rd symposium on theoretical aspects of computer science, STACS 2016, Orléans, France, February 17–20, 2016. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-001-9). LIPIcs – Leibniz International Proceedings in Informatics 47, Article 14, 14 p. (2016).
MSC:  68U05 68W40
PDFBibTeX XMLCite
Full Text: DOI

Tight bounds for beacon-based coverage in simple rectilinear polygons. (English) Zbl 1411.52006

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, 110-122 (2016).
MSC:  52B55 68Q25 68U05
PDFBibTeX XMLCite
Full Text: DOI

An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (extended abstract). (English) Zbl 1432.68485

Rahman, M. Sohel (ed.) et al., WALCOM: algorithms and computation. 9th international workshop, WALCOM 2015, Dhaka, Bangladesh, February 26–28, 2015. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 8973, 125-136 (2015).
MSC:  68U05 68W40
PDFBibTeX XMLCite
Full Text: DOI

Computing the \(L _{1}\) geodesic diameter and center of a simple polygon in linear time. (English) Zbl 1405.68395

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, 120-131 (2014).
MSC:  68U05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Bundling three convex polygons to minimize area or perimeter. (English) Zbl 1390.68702

Dehne, Frank (ed.) et al., Algorithms and data structures. 13th international symposium, WADS 2013, London, ON, Canada, August 12–14, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-40103-9/pbk). Lecture Notes in Computer Science 8037, 13-24 (2013).
MSC:  68U05 52B55 68W40
PDFBibTeX XMLCite
Full Text: DOI

Group nearest neighbor queries in the \(L _{1}\) plane. (English) Zbl 1382.68054

Chan, T-H. Hubert (ed.) et al., Theory and applications of models of computation. 10th international conference, TAMC 2013, Hong Kong, China, May 20–22, 2013. Proceedings. Berlin: Springer (ISBN 978-3-642-38235-2/pbk). Lecture Notes in Computer Science 7876, 52-61 (2013).
MSC:  68P05 68U05
PDFBibTeX XMLCite
Full Text: DOI

Area bounds of rectilinear polygons realized by angle sequences. (English) Zbl 1260.68406

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, 629-638 (2012).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Rectilinear covering for imprecise input points (extended abstract). (English) Zbl 1260.68404

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, 309-318 (2012).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

A generalization of the convex Kakeya problem. (English) Zbl 1297.52003

Fernández-Baca, David (ed.), LATIN 2012: Theoretical informatics. 10th Latin American symposium, Arequipa, Peru, April 16–20, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-29343-6/pbk). Lecture Notes in Computer Science 7256, 1-12 (2012).
MSC:  52B55 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Tight bound for farthest-color Voronoi diagrams of line segments. (English) Zbl 1350.68255

Rahman, Md. Saidur (ed.) et al., WALCOM: Algorithms and computation. 6th international workshop, WALCOM 2012, Dhaka, Bangladesh, February 15–17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28075-7/pbk). Lecture Notes in Computer Science 7157, 40-51 (2012).
MSC:  68U05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Farthest Voronoi diagrams under travel time metrics (extended abstract). (English) Zbl 1350.68256

Rahman, Md. Saidur (ed.) et al., WALCOM: Algorithms and computation. 6th international workshop, WALCOM 2012, Dhaka, Bangladesh, February 15–17, 2012. Proceedings. Berlin: Springer (ISBN 978-3-642-28075-7/pbk). Lecture Notes in Computer Science 7157, 28-39 (2012).
MSC:  68U05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

Generating realistic roofs over a rectilinear polygon. (English) Zbl 1350.68254

Asano, Takao (ed.) et al., Algorithms and computation. 22nd international symposium, ISAAC 2011, Yokohama, Japan, December 5–8, 2011. Proceedings. Berlin: Springer (ISBN 978-3-642-25590-8/pbk). Lecture Notes in Computer Science 7074, 60-69 (2011).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

The onion diagram: a Voronoi-like tessellation of a planar line space and its applications (extended abstract). (English) Zbl 1310.68197

Cheong, Otfried (ed.) et al., Algorithms and computation. 21st international symposium, ISAAC 2010, Jeju, Korea, December 15–17, 2010. Proceedings, Part II. Berlin: Springer (ISBN 978-3-642-17513-8/pbk). Lecture Notes in Computer Science 6507, 230-241 (2010).
MSC:  68U05 68P05
PDFBibTeX XMLCite
Full Text: DOI

The geodesic farthest-site Voronoi diagram in a polygonal domain with holes. (English) Zbl 1380.68378

Proceedings of the 25th annual symposium on computational geometry, SCG 2009, Aarhus, Denmark, June 8–10, 2009. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-60558-501-7). 198-207 (2009).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Querying two boundary points for shortest paths in a polygonal domain (extended abstract). (English) Zbl 1273.68095

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, 1054-1063 (2009).
MSC:  68P05 68U05
PDFBibTeX XMLCite
Full Text: DOI

Exact algorithms for the bottleneck Steiner tree problem (extended abstract). (English) Zbl 1272.68329

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, 24-33 (2009).
MSC:  68R10 05C85
PDFBibTeX XMLCite
Full Text: DOI

Square and rectangle covering with outliers. (English) Zbl 1248.68516

Deng, Xiaotie (ed.) et al., Frontiers in algorithmics. Third international workshop, FAW 2009, Hefei, China, June 20–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-02269-2/pbk). Lecture Notes in Computer Science 5598, 132-140 (2009).
MSC:  68U05 68Q25
PDFBibTeX XMLCite
Full Text: DOI

On exact solutions to the Euclidean bottleneck Steiner tree problem. (English) Zbl 1211.68462

Das, Sandip (ed.) et al., WALCOM: Algorithms and computation. Third international workshop, WALCOM 2009, Kolkata, India, February 18–20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00201-4/pbk). Lecture Notes in Computer Science 5431, 105-116 (2009).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

All farthest neighbors in the presence of highways and obstacles. (English) Zbl 1211.68461

Das, Sandip (ed.) et al., WALCOM: Algorithms and computation. Third international workshop, WALCOM 2009, Kolkata, India, February 18–20, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-00201-4/pbk). Lecture Notes in Computer Science 5431, 71-82 (2009).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Covering a point set by two disjoint rectangles. (English) Zbl 1183.68649

Hong, Seok-Hee (ed.) et al., Algorithms and computation. 19th international symposium, ISAAC 2008, Gold Coast, Australia, December 15–17, 2008. Proceedings. Berlin: Springer (ISBN 978-3-540-92181-3/pbk). Lecture Notes in Computer Science 5369, 728-739 (2008).
MSC:  68U05 68Q25 68W05
PDFBibTeX XMLCite
Full Text: DOI

Aperture-angle and Hausdorff-approximation of convex figures. (English) Zbl 1221.52012

Proceedings of the 23rd annual symposium on computational geometry 2007, Gyeongiu, South Korea, June 6–8, 2007. New York, NY: Association for Computing Machinery (ISBN 978-1-59593-705-6). 37-45 (2007).
MSC:  52A27 68U05
PDFBibTeX XMLCite
Full Text: DOI arXiv

Maintaining extremal points and its applications to deciding optimal orientations. (English) Zbl 1193.68264

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, 788-799 (2007).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Optimal construction of the city Voronoi diagram. Extended abstract. (English) Zbl 1135.68594

Asano, Tetsuo (ed.), Algorithms and computation. 17th international symposium, ISAAC 2006, Kolkata, India, December 18–20, 2006. Proceedings. Berlin: Springer (ISBN 978-3-540-49694-6/pbk). Lecture Notes in Computer Science 4288, 183-192 (2006).
MSC:  68U05
PDFBibTeX XMLCite
Full Text: DOI

Shortest paths and Voronoi diagrams with transportation networks under general distances. (Extended abstract). (English) Zbl 1175.90392

Deng, Xiaotie (ed.) et al., Algorithms and computation. 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19–21, 2005. Proceedings. Berlin: Springer (ISBN 3-540-30935-7/pbk). Lecture Notes in Computer Science 3827, 1007-1018 (2005).
MSC:  90C35 68U05
PDFBibTeX XMLCite
Full Text: DOI

Casting an object with a core. (English) Zbl 1173.65306

Deng, Xiaotie (ed.) et al., Algorithms and computation. 16th international symposium, ISAAC 2005, Sanya, Hainan, China, December 19–21, 2005. Proceedings. Berlin: Springer (ISBN 3-540-30935-7/pbk). Lecture Notes in Computer Science 3827, 40-49 (2005).
MSC:  65D17
PDFBibTeX XMLCite
Full Text: DOI

Voronoi diagrams with a transportation network on the Euclidean plane. (English) Zbl 1116.90309

Fleischer, Rudolf (ed.) et al., Algorithms and computation. 15th international symposium, ISAAC 2004, Hong Kong, China, December 20–22, 2004. Proceedings. Berlin: Springer (ISBN 3-540-24131-0/pbk). Lecture Notes in Computer Science 3341, 101-112 (2004).
MSC:  90B06 68U05 68W05
PDFBibTeX XMLCite
Full Text: DOI

Filter Results by …

Document Type

all top 5

Author

all top 5

Year of Publication

all top 3

Main Field

Software