×

Found 150 Documents (Results 1–100)

Newest Citations Relevance
Agarwal, Pankaj K.; Aronov, Boris; Ezra, Esther; Katz, Matthew J.; Sharir, Micha

Intersection queries for flat semi-algebraic objects in three dimensions and related problems. (English) Zbl 07849002

Goaoc, Xavier (ed.) et al., 38th international symposium on computational geometry, SoCG 2022, Berlin, Germany, June 7–10, 2022. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 224, Article 4, 14 p. (2022).
MSC:  68U05
Cite Review PDF
Full Text: DOI arXiv
Aronov, Boris; de Berg, Mark; Cardinal, Jean; Ezra, Esther; Iacono, John; Sharir, Micha

Subquadratic algorithms for some 3Sum-hard geometric problems in the algebraic decision tree model. (English) Zbl 1535.68423

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 3, 15 p. (2021).
MSC:  68U05 52C30 68W40
Cite Review PDF
Full Text: DOI
Aronov, Boris; Ezra, Esther; Sharir, Micha

Testing polynomials for vanishing on Cartesian products of planar point sets. (English) Zbl 07760137

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 8, 14 p. (2020).
MSC:  68U05
Cite Review PDF
Full Text: DOI
Aronov, Boris; De Berg, Mark; Gudmundsson, Joachim; Horton, Michael

On \(\beta\)-plurality points in spatial voting games. (English) Zbl 1533.68343

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 7, 15 p. (2020).
MSC:  68U05 91B12 68-06 68W99
Cite Review PDF
Full Text: DOI
Agarwal, Pankaj K.; Aronov, Boris; Ezra, Esther; Zahl, Joshua

An efficient algorithm for generalized polynomial partitioning and its applications. (English) Zbl 1542.14071

Barequet, Gill (ed.) et al., 35th international symposium on computational geometry, SoCG 2019, Portland, Oregon, USA, June 18–21, 2019. Proceedings. Wadern: Schloss Dagstuhl – Leibniz-Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 129, Article 5, 14 p. (2019).
Reviewer: Aris Daniilidis (Wien)
MSC:  14P10 68W20 52B55 03C10 68P05 68U05
Cite Review PDF
Full Text: DOI
Aronov, Boris; Filtser, Omrit; Katz, Matthew J.; Sheikhan, Khadijeh

Bipartite diameter and other measures under translation. (English) Zbl 07559117

Niedermeier, Rolf (ed.) et al., 36th international symposium on theoretical aspects of computer science, STACS 2019, March 13–16, 2019, Berlin, Germany. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 126, Article 8, 14 p. (2019).
MSC:  68U05 68W40
Cite Review PDF
Full Text: DOI
Aronov, Boris; Filtser, Omrit; Horton, Michael; Katz, Matthew J.; Sheikhan, Khadijeh

Efficient nearest-neighbor query and clustering of planar curves. (English) Zbl 1534.68237

Friggstad, Zachary (ed.) et al., Algorithms and data structures. 16th international symposium, WADS 2019, Edmonton, AB, Canada, August 5–7, 2019. Proceedings. Cham: Springer. Lect. Notes Comput. Sci. 11646, 28-42 (2019).
MSC:  68U05 68P05 68W25
Cite Review PDF
Full Text: DOI arXiv
Aronov, Boris; Ezra, Esther; Zahl, Joshua

Constructive polynomial partitioning for algebraic curves in \(\mathbb{R}^3\) with applications. (English) Zbl 1432.68482

Chan, Timothy M. (ed.), Proceedings of the 30th annual ACM-SIAM symposium on discrete algorithms, SODA 2019, San Diego, CA, USA, January 6–9, 2019. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2636-2648 (2019).
MSC:  68U05 14P05 14Q05 14Q30 68W40
Cite Review PDF
Full Text: DOI
Aronov, Boris; Bar-On, Gali; Katz, Matthew J.

Resolving SINR queries in a dynamic setting. (English) Zbl 1497.68136

Chatzigiannakis, Ioannis (ed.) et al., 45th international colloquium on automata, languages, and programming. ICALP 2018, Prague, Czech Republic, July 9–13, 2018. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik. LIPIcs – Leibniz Int. Proc. Inform. 107, Article 145, 13 p. (2018).
MSC:  68P05 68U05 68W20 68W40 94A05
Cite Review PDF
Full Text: DOI
Aronov, Boris; Miller, Edward Y.; Sharir, Micha

Eliminating depth cycles among triangles in three dimensions. (English) Zbl 1410.68362

Klein, Philip N. (ed.), Proceedings of the 28th annual ACM-SIAM symposium on discrete algorithms, SODA 2017, Barcelona, Spain, January 16–19, 2017. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 2476-2494 (2017).
MSC:  68U05 14Q20 52C35 52C45
Cite Review PDF
Full Text: DOI
Aronov, Boris (ed.); Katz, Matthew J. (ed.)

33rd international symposium on computational geometry. SoCG 2017, Brisbane, Australia, July 4–7, 2017. Proceedings. (English) Zbl 1366.68003

LIPIcs – Leibniz International Proceedings in Informatics 77. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-038-5). xvii, 67 articles, not consecutively paged, electronic only, open access (2017).
MSC:  68-06 68U05 00B25
Cite Review PDF
Full Text: DOI Link
Aronov, Boris; Cheong, Otfried; Dobbins, Michael Gene; Goaoc, Xavier

The number of holes in the union of translates of a convex set in three dimensions. (English) Zbl 1387.52004

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 10, 16 p. (2016).
MSC:  52A20 68Q17 68T40 68U05
Cite Review PDF
Full Text: DOI arXiv
Aronov, Boris; Korman, Matias; Pratt, Simon; van Renssen, André; Roeloffzen, Marcel

Time-space trade-offs for triangulating a simple polygon. (English) Zbl 1378.68190

Pagh, Rasmus (ed.), 15th Scandinavian symposium and workshops on algorithm theory, SWAT 2016, Reykjavik, Iceland, June 22–24, 2016. Proceedings. Wadern: Schloss Dagstuhl – Leibniz Zentrum für Informatik (ISBN 978-3-95977-011-8). LIPIcs – Leibniz International Proceedings in Informatics 53, Article 30, 12 p. (2016).
MSC:  68W20 68U05 68W40
Cite Review PDF
Full Text: DOI arXiv
Aronov, Boris; Driemel, Anne; van Kreveld, Marc; Löffler, Maarten; Staals, Frank

Segmentation of trajectories on non-monotone criteria. (English) Zbl 1422.68239

Khanna, Sanjeev (ed.), Proceedings of the 24th annual ACM-SIAM symposium on discrete algorithms, SODA 2013, New Orleans, LA, USA, January 6–8, 2013. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1897-1911 (2013).
MSC:  68U05 68Q25
Cite Review PDF
Full Text: DOI Link
Moroz, Guillaume; Aronov, Boris

Computing the distance between piecewise-linear bivariate functions. (English) Zbl 1422.68255

Rabani, Yuval (ed.), Proceedings of the 23rd annual ACM-SIAM symposium on discrete algorithms, SODA 2012, Kyoto, Japan, January 17–19, 2012. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 288-293 (2012).
MSC:  68U05
Cite Review PDF
Full Text: arXiv Link
Ezra, Esther; Aronov, Boris; Sharir, Micha

Improved bound for the union of fat triangles. (English) Zbl 1375.68130

Randall, Dana (ed.), Proceedings of the 22nd annual ACM-SIAM symposium on discrete algorithms, SODA 2011, San Francisco, CA, USA, January 23–25, 2011. Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM); New York, NY: Association for Computing Machinery (ACM). 1778-1785 (2011).
MSC:  68U05
Cite Review PDF
Full Text: Link
Abam, Mohammad Ali; Aronov, Boris; De Berg, Mark; Khosravi, Amirali

Approximation algorithms for computing partitions with minimum stabbing number of rectilinear and simple polygons. (English) Zbl 1283.68334

Proceedings of the 27th annual symposium on computational geometry, SoCG 2011, Paris, France, June 13–15, 2011. New York, NY: Association for Computing Machinery (ACM) (ISBN 978-1-4503-0682-9). 407-416 (2011).
MSC:  68U05 68Q25 68W25
Cite Review PDF
Full Text: DOI Link
Aronov, Boris; Buchin, Kevin; Buchin, Maike; van Kreveld, Marc; Löffler, Maarten; Luo, Jun; Silveira, Rodrigo I.; Speckmann, Bettina

Connect the dot: computing feed-links with minimum dilation. (English) Zbl 1253.68327

Dehne, Frank (ed.) et al., Algorithms and data structures. 11th international symposium, WADS 2009, Banff, Canada, August 21–23, 2009. Proceedings. Berlin: Springer (ISBN 978-3-642-03366-7/pbk). Lecture Notes in Computer Science 5664, 49-60 (2009).
MSC:  68U05 68R10
Cite Review PDF
Full Text: DOI
Aronov, Boris; de Berg, Mark; Gray, Chris; Mumford, Elena

Cutting cycles of rods in space: hardness and approximation. (English) Zbl 1192.68340

Proceedings of the nineteenth annual ACM-SIAM symposium on discrete algorithms, San Francisco, CA, January 20–22, 2008. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 978-0-898716-47-4). 1241-1248 (2008).
MSC:  68Q25 52B55 68U05 68W25
Cite Review PDF
Aronov, Boris; Bose, Prosenjit; Demaine, Erik D.; Gudmundsson, Joachim; Iacono, John; Langerman, Stefan; Smid, Michiel

Data structures for halfplane proximity queries and incremental Voronoi diagrams. (English) Zbl 1145.68554

Correa, José R. (ed.) et al., LATIN 2006: Theoretical informatics. 7th Latin American symposium, Valdivia, Chile, March 20–24, 2006. Proceedings. Berlin: Springer (ISBN 3-540-32755-X/pbk). Lecture Notes in Computer Science 3887, 80-92 (2006).
MSC:  68U05 68P05
Cite Review PDF
Full Text: DOI arXiv
Aronov, Boris; de Berg, Mark; Cheong, Otfried; Gudmundsson, Joachim; Haverkort, Herman; Vigneron, Antoine

Sparse geometric graphs with small dilation. (English) Zbl 1173.68595

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, 50-59 (2005).
MSC:  68R10 05C62 68U05
Cite Review PDF
Full Text: DOI
Agarwal, Pankaj K.; Aronov, Boris; Koltun, Vladlen

Efficient algorithms for bichromatic separability. (English) Zbl 1318.68179

Proceedings of the fifteenth annual ACM-SIAM symposium on discrete algorithms, SODA 2004, New Orleans, LA, USA, January 11–13, 2004. New York, NY: Association for Computing Machinery (ACM); Philadelphia, PA: Society for Industrial and Applied Mathematics (SIAM) (ISBN 0-89871-558-X). 682-690 (2004).
MSC:  68U05 68Q25 68W05
Cite Review PDF
Aronov, Boris; Asano, Tetsuo; Katoh, Naoki; Mehlhorn, Kurt; Tokuyama, Takeshi

Polyline fitting of planar points under min-sum criteria. (English) Zbl 1116.65310

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, 77-88 (2004).
MSC:  65D10 62J02 68U05
Cite Review PDF
Full Text: DOI

Filter Results by …

Access

Document Type

Database

all top 5

Author

all top 5

Serial

all top 5

Year of Publication

all top 3

Main Field

Biographic Reference

Software