Oswin Aichholzer, José Miguel Díaz-Báñez, Thomas Hackl, David
Orden, Alexander Pilz, Inmaculada Ventura, and Birgit Vogtenhuber.
Erdős-Szekeres-Type
Games.
In Proc. 35th European Workshop on Computational Geometry
EuroCG '19, pages 23:1--23:7, Utrecht, The Netherlands, 2019.
[ bib |
.pdf |
.pdf ]
O. Aichholzer, M. Balko, T. Hackl, A. Pilz, P. Ramos, P. Valtr, and
B. Vogtenhuber.
Holes in 2-convex
point sets.
In Proc. 28th International Workshop on Combinatorial
Algorithms (IWOCA2017), volume 10765 of Lecture Notes in Computer
Science (LNCS), pages 169--181, Newcastle, Australia, 2018.
[ bib |
DOI ]
O. Aichholzer, M. Balko, T. Hackl, A. Pilz, P. Ramos, P. Valtr, and
B. Vogtenhuber.
Holes in 2-convex
point sets.
Computational Geometry: Theory and Applications, 74:38--49,
2018.
[ bib |
DOI ]
Oswin Aichholzer, Ruy Fabila-Monroy, David Flores-Peñaloza, Thomas Hackl,
Jorge Urrutia, and Birgit Vogtenhuber.
Modem Illumination of
Monotone Polygons.
Computational Geometry: Theory and Applications, 68:101--118,
2018.
Special Issue in Memory of Ferran Hurtado.
[ bib |
DOI |
http ]
O. Aichholzer, M. Balko, T. Hackl, J. Kynčl, I. Parada, M. Scheucher,
P. Valtr, and B. Vogtenhuber.
A superlinear lower
bound on the number of 5-holes.
In Boris Aronov and Matthew J. Katz, editors, 33rd International
Symposium on Computational Geometry (SoCG 2017), volume 77 of Leibniz
International Proceedings in Informatics (LIPIcs), pages 8:1--8:16,
Brisbane, Australia, 2017. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
[ bib |
DOI |
arXiv |
.pdf ]
O. Aichholzer, M. Balko, T. Hackl, J. Kynčl, I. Parada, M. Scheucher,
P. Valtr, and B. Vogtenhuber.
A superlinear
lower bound on the number of 5-holes.
In Proc. 33rd European Workshop on Computational Geometry
EuroCG '17, pages 69--73, Malmö, Sweden, 2017.
[ bib |
arXiv |
.pdf ]
Oswin Aichholzer, Thomas Hackl, Pavel Valtr, and Birgit Vogtenhuber.
A Note on the Number of
General 4-holes in (Perturbed) Grids.
In Jin Akiyama, Hiro Ito, Toshinori Sakai, and Yushi Uno, editors,
Discrete and Computational Geometry and Graphs. JCDCGG 2015., volume
9943 of Lecture Notes in Computer Science (LNCS), pages 1--12.
Springer, Cham, 2016.
[ bib |
DOI ]
Oswin Aichholzer, Thomas Hackl, Matias Korman, Alexander Pilz, Günter Rote,
André van Renssen, Marcel Roeloffzen, and Birgit Vogtenhuber.
Packing Short Plane
Spanning Trees in Complete Geometric Graphs.
In Seok-Hee Hong, editor, 27th International Symposium on
Algorithms and Computation (ISAAC 2016), volume 64 of Leibniz
International Proceedings in Informatics (LIPIcs), pages 9:1--9:12,
Dagstuhl, Germany, 2016. Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik.
[ bib |
DOI |
http ]
O. Aichholzer, M. Balko, T. Hackl, A. Pilz, P. Ramos, B. Vogtenhuber, and
P. Valtr.
Holes in two convex
point sets.
In Proc. 32st European Workshop on Computational Geometry
EuroCG '16, pages 263--266, Lugano, Switzerland, 2016.
[ bib |
arXiv |
.pdf ]
O. Aichholzer, V. Alvarez, T. Hackl, A. Pilz, B. Speckmann, and B. Vogtenhuber.
An improved lower
bound on the number of triangulations.
In Proc. 32nd Int. Sympos. Comput. Geom. (SoCG)
volume 51 of Leibniz International Proceedings in Informatics (LIPIcs),
pages 7:1--7:16, Boston, USA, 2016.
[ bib |
DOI |
arXiv |
.pdf ]
O. Aichholzer, T. Hackl, P. Valtr, and B. Vogtenhuber.
A note on the number of
general 4-holes in perturbed grids.
In Proc. 18th Japan Conference on Discrete and
Computational Geometry and Graphs (JCDCG2 2015), pages 68--69, Kyoto,
Japan, 2015.
[ bib ]
O. Aichholzer, T. Biedl, T. Hackl, M. Held, S. Huber, P. Palfrader, and
B. Vogtenhuber.
Representing
Directed Trees as Straight Skeletons.
In Emilio Di Giacomo and Anna Lubiw, editors, Proc. 23nd
International Symposium on Graph Drawing (GD 2015), volume 9411 of
Lecture Notes in Computer Science (LNCS), pages 335--347, Los Angeles, CA,
USA, 2015.
[ bib |
DOI |
.pdf ]
B.M. Ábrego, O. Aichholzer, S. Fernández-Merchant, T. Hackl, J. Pammer,
A. Pilz, P. Ramos, G. Salazar, and B. Vogtenhuber.
All Good Drawings
of Small Complete Graphs.
In Proc. 31st European Workshop on Computational Geometry
EuroCG '15, pages 57--60, Ljubljana, Slovenia, 2015.
[ bib |
.pdf ]
Oswin Aichholzer, Ruy Fabila-Monroy, Hernan Gonzalez-Aguilar, Thomas Hackl,
Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Pavel Valtr, and Birgit
Vogtenhuber.
On k-Gons and
k-Holes in Point Sets.
Computational Geometry: Theory and Applications,
48(7):528--537, 2015.
[ bib |
DOI |
.pdf ]
O. Aichholzer, F. Aurenhammer, T. Hackl, C. Huemer, A. Pilz, and
B. Vogtenhuber.
3-Colorability
of Pseudo-Triangulations.
Int'l Journal of Computational Geometry & Applications,
25(4):283--298, 2015.
[ bib |
DOI |
.pdf ]
O. Aichholzer, F. Aurenhammer, T. Hackl, F. Hurtado, A. Pilz, P. Ramos,
J. Urrutia, P. Valtr, and B. Vogtenhuber.
On k-Convex Point
Sets.
Computational Geometry: Theory and Applications,
47(8):809--832, 2014.
[ bib |
DOI |
http |
.pdf ]
O. Aichholzer, T. Hackl, S. Lutteropp, T. Mchedlidze, A. Pilz, and
B. Vogtenhuber.
Monotone Simultaneous
Embedding of Directed Paths.
In Proc. 30th European Workshop on Computational Geometry
EuroCG '14, page online, Dead Sea, Israel, 2014.
[ bib |
.pdf ]
O. Aichholzer, R. Fabila-Monroy, T. Hackl, C. Huemer, and J. Urrutia.
Empty Monochromatic
Simplices.
Discrete & Computational Geometry, 51(2):362--393, 2014.
[ bib |
DOI |
.pdf ]
O. Aichholzer, R. Fabila-Monroy, H. González-Aguilar, T. Hackl, M.A.
Heredia, C. Huemer, J. Urrutia, and B. Vogtenhuber.
4-Holes in
Point Sets.
Computational Geometry: Theory and Applications,
47(6):644--650, 2014.
Special Issue on the 27th European Workshop on Computational Geometry
(EuroCG 2011).
[ bib |
DOI |
.pdf ]
O. Aichholzer, T. Hackl, M. Hoffmann, A. Pilz, G. Rote, B. Speckmann, and
B. Vogtenhuber.
Plane graphs with
parity constraints.
Graphs and Combinatorics, 30(1):47--69, 2014.
[ bib |
DOI |
.pdf ]
Oswin Aichholzer, Thomas Hackl, Matias Korman, Marc van Kreveld, Maarten
Löffler, Alexander Pilz, Bettina Speckmann, and Emo Welzl.
Packing Plane
Spanning Trees and Paths in Complete Geometric Graphs.
In Proc. 26th Annual Canadian Conference on Computational
Geometry (CCCG 2014), page online, Halifax, Nova Scotia, Canada, 2014.
[ bib |
.pdf ]
Oswin Aichholzer, Thomas Hackl, Sarah Lutteropp, Tamara Mchedlidze, and Birgit
Vogtenhuber.
Embedding
Four-directional Paths on Convex Point Sets.
In C. Duncan and A. Symvonis, editors, Proc. 22nd
International Symposium on Graph Drawing (GD 2014), volume 8871 of
Lecture Notes in Computer Science (LNCS), pages 355--366, Würzburg,
Germany, 2014.
[ bib |
.pdf ]
O. Aichholzer, T. Hackl, M. Korman, A. Pilz, and B. Vogtenhuber.
Geodesic-preserving
polygon simplification.
In Lecture Notes in Computer Science (LNCS), Proc. 24th
Int. Symp. Algorithms and Computation (ISAAC 2013), volume 8283, pages
11--21, Hong Kong, China, 2013. Springer Verlag.
[ bib |
.pdf ]
A. Asinowski, J. Cardinal, N. Cohen, S. Collette, T. Hackl, M. Hoffmann,
K. Knauer, S. Langerman, M. Lasoń, P. Micek, G. Rote, and T. Ueckerdt.
Coloring
Hypergraphs Induced by Dynamic Point Sets and Bottomless Rectangles.
In Lecture Notes in Computer Science (LNCS), Proc. 13th
Algorithms and Data Structures Symposium (WADS 2013), volume 8037, pages
73--84, London, Ontario, Canada, 2013.
[ bib |
.pdf ]
O. Aichholzer, J. Cardinal, T. Hackl, F. Hurtado, M. Korman, A. Pilz, R.I.
Silveira, R. Uehara, B. Vogtenhuber, and E. Welzl.
Cell-Paths in
Mono- and Bichromatic Line Arrangements in the Plane.
In Proc. 25th Annual Canadian Conference on Computational
Geometry CCCG 2013, pages 169--174, Waterloo, Ontario, Canada, 2013.
[ bib |
.pdf ]
O. Aichholzer, T. Hackl, A. Pilz, P. Ramos, V. Sacristán, and
B. Vogtenhuber.
Empty triangles in
good drawings of the complete graph.
In Mexican Conference on Discrete Mathematics and Computational
Geometry, pages 21--29, Oaxaca, México, 2013.
[ bib |
arXiv |
.pdf ]
O. Aichholzer, T. Hackl, V. Sacristán, B. Vogtenhuber, and R. Wallner.
Simulating distributed
algorithms for lattice agents.
In Proc. 15th Spanish Meeting on Computational Geometry
2013, pages 81--84, Sevilla, Spain, 2013.
[ bib |
.pdf ]
O. Aichholzer, R. Fabila-Monroy, T. Hackl, M. van Kreveld, A. Pilz, P. Ramos,
and B. Vogtenhuber.
Blocking Delaunay
Triangulations.
Computational Geometry: Theory and Applications,
46(2):154--159, 2013.
[ bib |
DOI |
.pdf ]
O. Aichholzer, R. Fabila-Monroy, T. Hackl, C. Huemer, A. Pilz, and
B. Vogtenhuber.
Lower bounds for the
number of small convex k-holes.
In Proc. 24th Annual Canadian Conference on Computational
Geometry CCCG 2012, pages 247--252, Charlottetown, PEI, Canada, 2012.
[ bib |
.pdf ]
O. Aichholzer, H. Cheng, S.L. Devadoss, T. Hackl, S. Huber, B. Li, and
A. Risteski.
What makes a Tree a
Straight Skeleton?
In Proc. 24th Annual Canadian Conference on Computational
Geometry CCCG 2012, pages 253--258, Charlottetown, PEI, Canada, 2012.
[ bib |
.pdf ]
O. Aichholzer, H. Cheng, S.L. Devadoss, T. Hackl, S. Huber, B. Li, and
A. Risteski.
What makes a Tree a
Straight Skeleton?
In Proc. 28th European Workshop on Computational Geometry
EuroCG '12, pages 137--140, Assisi, Italy, 2012.
[ bib |
.pdf ]
O. Aichholzer, T. Hackl, and B. Vogtenhuber.
On 5-Gons and
5-Holes.
In A. Marquez, P. Ramos, and J. Urrutia, editors, Computational
Geometry: XIV Spanish Meeting on Computational Geometry, EGC 2011,
Festschrift Dedicated to Ferran Hurtado on the Occasion of His 60th Birthday,
Alcalá de Henares, Spain, June 27-30, 2011, Revised Selected Papers,
volume 7579 of Lecture Notes in Computer Science (LNCS), pages 1--13.
Springer, 2012.
[ bib |
.pdf ]
Oswin Aichholzer, Ruy Fabila-Monroy, Hernan Gonzalez-Aguilar, Thomas Hackl,
Marco A. Heredia, Clemens Huemer, Jorge Urrutia, Pavel Valtr, and Birgit
Vogtenhuber.
On k-Gons and
k-Holes in Point Sets.
In Proc. 23rd Annual Canadian Conference on Computational
Geometry CCCG 2011, pages 21--26, Toronto, Canada, 2011.
[ bib |
.pdf ]
O. Aichholzer, T. Hackl, and B. Vogtenhuber.
On 5-gons and 5-holes.
In Proc. XIV Encuentros de Geometría Computacional, pages
7--10, Alcalá, Spain, 2011.
[ bib |
.pdf ]
O. Aichholzer, R. Fabila-Monroy, H. González-Aguilar, T. Hackl, M.A.
Heredia, C. Huemer, J. Urrutia, and B. Vogtenhuber.
4-Holes in
Point Sets.
In Proc. 27th European Workshop on Computational Geometry
EuroCG '11, pages 115--118, Morschach, Switzerland, 2011.
[ bib |
.pdf ]
O. Aichholzer, W. Aigner, T. Hackl, and N. Wolpert.
Exact medial axis
computation for circular arc boundaries.
In J.D. Boissonat, M.L. Mazure, and L.L. Schumaker, editors,
Proc. 7th International Conference on Curves and Surfaces 2010 (Avignon,
France), LNCS 6920, number 6920 in Lecture Notes in Computer Science (LNCS),
pages 28--42, Avignon, France, 2011. Springer.
[ bib |
.pdf ]
Oswin Aichholzer, Daniel Detassis, Thomas Hackl, Gerald Steinbauer, and
Johannes Thonhauser.
"Playing Pylos with an
Autonomous Robot".
In IEEE/RSJ International Conference on Intelligent Robots and
Systems (IROS), pages 2507--2508, Taipei, Taiwan, 2010.
[ bib |
.pdf ]
O. Aichholzer, T. Hackl, and B. Vogtenhuber.
Compatible Pointed
Pseudo-Triangulations.
In Proc. 22nd Annual Canadian Conference on Computational
Geometry CCCG 2010, pages 91--94, Winnipeg, Manitoba, Canada, 2010.
[ bib |
.pdf ]
O. Aichholzer, R. Fabila-Monroy, T. Hackl, M. van Kreveld, A. Pilz, P. Ramos,
and B. Vogtenhuber.
Blocking Delaunay
Triangulations.
In Proc. 22nd Annual Canadian Conference on Computational
Geometry CCCG 2010, pages 21--24, Winnipeg, Manitoba, Canada, 2010.
[ bib |
.pdf ]
O. Aichholzer, F. Aurenhammer, T. Hackl, C. Huemer, A. Pilz, and
B. Vogtenhuber.
3-Colorability
of Pseudo-Triangulations.
In Proc. 26th European Workshop on Computational Geometry
EuroCG '10, pages 21--24, Dortmund, Germany, 2010.
[ bib |
.pdf ]
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler,
E. Pilgerstorfer, and M. Rabl.
Divide-and conquer
for Voronoi diagrams revisited.
Computational Geometry: Theory and Applications,
43(8):688--699, 2010.
Special Issue on the 25th Annual Symposium on Computational Geometry
(SoCG'09).
[ bib |
DOI |
.pdf ]
O. Aichholzer, T. Hackl, M. Hoffmann, A. Pilz, G. Rote, B. Speckmann, and
B. Vogtenhuber.
Plane Graphs with
Parity Constraints.
In Lecture Notes in Computer Science (LNCS), Proc. 11th
International Workshop on Algorithms and Data Structures (WADS), volume
5664, pages 13--24, Banff, Alberta, Canada, 2009.
[ bib |
.pdf ]
O. Aichholzer, T. Hackl, D. Orden, P. Ramos, G. Rote, A. Schulz, and
B. Speckmann.
Flip Graphs of
Bounded-Degree Triangulations.
In Electronic Notes in Discrete Mathematics: Proc. European
Conference on Combinatorics, Graph Theory and Applications EuroComb 2009,
volume 34, pages 509--513, Bordeaux, France, 2009.
[ bib |
arXiv |
.pdf ]
O. Aichholzer, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer,
J. Urrutia, and B. Vogtenhuber.
Modem Illumination of
Monotone Polygons.
In Proc. 25th European Workshop on Computational Geometry
EuroCG '09, pages 167--170, Brussels, Belgium, 2009.
[ bib |
.pdf ]
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler,
E. Pilgerstorfer, and M. Rabl.
Divide-and-Conquer
for Voronoi Diagrams Revisited.
In 25th Ann. ACM Symp. Computational Geometry, pages
189--197, Aarhus, Denmark, 2009.
[ bib |
.pdf ]
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler,
E. Pilgerstorfer, and M. Rabl.
Divide-and-Conquer
for Voronoi Diagrams Revisited.
In Proc. 25th European Workshop on Computational Geometry
EuroCG '09, pages 293--296, Brussels, Belgium, 2009.
[ bib |
.pdf ]
O. Aichholzer, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer,
and J. Urrutia.
Empty Monochromatic
Triangles.
Computational Geometry: Theory and Applications,
42(9):934--938, 2009.
[ bib |
DOI |
.pdf ]
O. Aichholzer, W. Aigner, F. Aurenhammer, T. Hackl, B. Jüttler, and
M. Rabl.
Medial Axis
Computation for Planar Free-Form Shapes.
Computer-Aided Design, 41(5):339--349, 2009.
Special issue: Voronoi Diagrams and their Applications.
[ bib |
DOI |
.pdf ]
O. Aichholzer, F. Aurenhammer, T. Hackl, and B. Speckmann.
On Minimum Weight
Pseudo-Triangulations.
Computational Geometry: Theory and Applications,
42(6-7):627--631, 2009.
[ bib |
.pdf ]
O. Aichholzer, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl, C. Huemer,
and J. Urrutia.
Empty Monochromatic
Triangles.
In Proc. 20th Annual Canadian Conference on Computational
Geometry CCCG 2008, pages 75--78, Montreal, Quebec, Canada, 2008.
[ bib |
.pdf ]
O. Aichholzer, S. Cabello, R. Fabila-Monroy, D. Flores-Peñaloza, T. Hackl,
C. Huemer, F. Hurtado, and D.R. Wood.
Edge-Removal and
Non-Crossing Configurations in Geometric Graphs.
In Proc. 24th European Workshop on Computational Geometry
EuroCG '08, pages 119--122, Nancy, France, 2008.
[ bib |
.pdf ]
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Kornberger, S. Plantinga, G. Rote,
A. Sturm, and G. Vegter.
Seed Polytopes for
Incremental Approximation.
In Proc. 24th European Workshop on Computational Geometry
EuroCG '08, pages 13--16, Nancy, France, 2008.
[ bib |
.ps.gz ]
O. Aichholzer, F. Aurenhammer, P. Gonzalez-Nava, T. Hackl, C. Huemer,
F. Hurtado, H. Krasser, S. Ray, and B. Vogtenhuber.
Matching Edges and
Faces in Polygonal Partitions.
Computational Geometry: Theory and Applications,
39(2):134--141, 2008.
[ bib |
.ps.gz ]
O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, A. Por, F. Santos,
B. Speckmann, and B. Vogtenhuber.
Maximizing Maximal
Angles for Plane Straight Line Graphs.
In Lecture Notes in Computer Science (LNCS), Proc. 10th
International Workshop on Algorithms and Data Structures (WADS), volume
4619, pages 458--469, Halifax, Nova Scotia, Canada, 2007.
[ bib |
DOI |
arXiv |
.pdf ]
O. Aichholzer, T. Hackl, M. Hoffmann, C. Huemer, F. Santos, B. Speckmann, and
B. Vogtenhuber.
Maximizing Maximal
Angles for Plane Straight Line Graphs.
In Proc. 23rd European Workshop on Computational Geometry
EuroCG '07, pages 98--101, Graz, Austria, 2007.
[ bib |
arXiv |
.pdf ]
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Jüttler, M. Oberneder, and
Z. Sír.
Computational and
Structural Advantages of Circular Boundary Representation.
In Lecture Notes in Computer Science (LNCS), Proc. 10th
International Workshop on Algorithms and Data Structures (WADS), volume
4619, pages 374--385, Halifax, Nova Scotia, Canada, 2007.
[ bib |
.ps.gz ]
O. Aichholzer, F. Aurenhammer, T. Hackl, B. Kornberger, M. Peternell, and
H. Pottmann.
Approximating
Boundary-Triangulated Objects with Balls.
In Proc. 23rd European Workshop on Computational Geometry
EuroCG '07, pages 130--133, Graz, Austria, 2007.
[ bib |
.pdf ]
O. Aichholzer, F. Aurenhammer, T. Hackl, and B. Speckmann.
On (Pointed) Minimum
Weight Pseudo-Triangulations.
In Proc. 19th Annual Canadian Conference on Computational
Geometry CCCG 2007, pages 209--212, Ottawa, Ontario, Canada, 2007.
[ bib |
.pdf ]
O. Aichholzer, F. Aurenhammer, T. Hackl, and C. Huemer.
Connecting Colored Point
Sets.
Discrete Applied Mathematics, 155(3):271--278, 2007.
[ bib |
.ps.gz ]
O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, and B. Vogtenhuber.
On the number of plane
graphs.
In Proc. 17th Annual ACM-SIAM Symposium on Discrete
Algorithms (SODA), pages 504--513, Miami, Florida, USA, 2006.
[ bib |
.pdf ]
O. Aichholzer, T. Hackl, C. Huemer, F. Hurtado, H. Krasser, and B. Vogtenhuber.
Bounding the number of
plane graphs.
In Proc. 15th Annual Fall Workshop on Computational
Geometry and Visualization, pages 31--32, Philadelphia, Pennsylvania, USA,
2005.
[ bib ]
O. Aichholzer, F. Aurenhammer, P. Gonzalez-Nava, T. Hackl, C. Huemer,
F. Hurtado, H. Krasser, S. Ray, and B. Vogtenhuber.
Matching Edges and
Faces in Polygonal Partitions.
In Proc. 17th Annual Canadian Conference on Computational
Geometry CCCG 2005, pages 123--126, Windsor, Ontario, Canada, 2005.
[ bib |
.ps.gz ]