Oswin Aichholzer

According to our database1, Oswin Aichholzer
  • authored at least 185 papers between 1994 and 2018.
  • has a "Dijkstra number"2 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2018
Modem illumination of monotone polygons.
Comput. Geom., 2018

Linear transformation distance for bichromatic matchings.
Comput. Geom., 2018

2017
Packing plane spanning trees and paths in complete geometric graphs.
Inf. Process. Lett., 2017

An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings.
Int. J. Comput. Geometry Appl., 2017

Geodesic Order Types.
CoRR, 2017

Packing Short Plane Spanning Graphs in Complete Geometric Graphs.
CoRR, 2017

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs.
CoRR, 2017

A Superlinear Lower Bound on the Number of 5-Holes.
Proceedings of the 33rd International Symposium on Computational Geometry, 2017

2016
Reconstructing Point Set Order Types from Radial Orderings.
Int. J. Comput. Geometry Appl., 2016

Geometric Achromatic and Pseudoachromatic Indices.
Graphs and Combinatorics, 2016

Packing Short Plane Spanning Trees in Complete Geometric Graphs.
Proceedings of the 27th International Symposium on Algorithms and Computation, 2016

An Improved Lower Bound on the Minimum Number of Triangulations.
Proceedings of the 32nd International Symposium on Computational Geometry, 2016

2015
Embedding Four-directional Paths on Convex Point Sets.
J. Graph Algorithms Appl., 2015

Monotone Simultaneous Embeddings of Upward Planar Digraphs.
J. Graph Algorithms Appl., 2015

Triangulations with Circular Arcs.
J. Graph Algorithms Appl., 2015

3-Colorability of Pseudo-Triangulations.
Int. J. Comput. Geometry Appl., 2015

Empty Triangles in Good Drawings of the Complete Graph.
Graphs and Combinatorics, 2015

Characterization of Extremal Antipodal Polygons.
Graphs and Combinatorics, 2015

Flip Distance Between Triangulations of a Simple Polygon is NP-Complete.
Discrete & Computational Geometry, 2015

Modem Illumination of Monotone Polygons.
CoRR, 2015

An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings.
CoRR, 2015

Representing Directed Trees as Straight Skeletons.
CoRR, 2015

Balanced Islands in Two Colored Point Sets in the Plane.
CoRR, 2015

Bishellable drawings of Kn.
CoRR, 2015

On k-gons and k-holes in point sets.
Comput. Geom., 2015

Reprint of: Theta-3 is connected.
Comput. Geom., 2015

Disjoint Compatibility Graph of Non-Crossing Matchings of Points in Convex Position.
Electr. J. Comb., 2015

A Note on the Number of General 4-holes in (Perturbed) Grids.
Proceedings of the Discrete and Computational Geometry and Graphs - 18th Japan Conference, 2015

An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings.
Proceedings of the Algorithms and Computation - 26th International Symposium, 2015

Representing Directed Trees as Straight Skeletons.
Proceedings of the Graph Drawing and Network Visualization - 23rd International Symposium, 2015

Folding Polyominoes into (Poly)Cubes.
Proceedings of the 27th Canadian Conference on Computational Geometry, 2015

2014
Covering Folded Shapes.
JoCG, 2014

Flips in Combinatorial pointed Pseudo-Triangulations with Face degree at most Four.
Int. J. Comput. Geometry Appl., 2014

Geodesic-Preserving Polygon Simplification.
Int. J. Comput. Geometry Appl., 2014

Plane Graphs with Parity Constraints.
Graphs and Combinatorics, 2014

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Discrete Mathematics & Theoretical Computer Science, 2014

Empty Monochromatic Simplices.
Discrete & Computational Geometry, 2014

Shellable Drawings and the Cylindrical Crossing Number of Kn.
Discrete & Computational Geometry, 2014

On $k$-Gons and $k$-Holes in Point Sets.
CoRR, 2014

Embedding Four-directional Paths on Convex Point Sets.
CoRR, 2014

Theta-3 is connected.
CoRR, 2014

Disjoint compatibility graph of non-crossing matchings of points in convex position.
CoRR, 2014

Covering Folded Shapes.
CoRR, 2014

Reprint of: Extreme point and halving edge search in abstract order types.
Comput. Geom., 2014

Lower bounds for the number of small convex k-holes.
Comput. Geom., 2014

4-Holes in point sets.
Comput. Geom., 2014

Theta-3 is connected.
Comput. Geom., 2014

On k-convex point sets.
Comput. Geom., 2014

Geodesic Order Types.
Algorithmica, 2014

Reconstructing Point Set Order Typesfrom Radial Orderings.
Proceedings of the Algorithms and Computation - 25th International Symposium, 2014

Embedding Four-Directional Paths on Convex Point Sets.
Proceedings of the Graph Drawing - 22nd International Symposium, GD 2014, Würzburg, 2014

Linear transformation distance for bichromatic matchings.
Proceedings of the 30th Annual Symposium on Computational Geometry, 2014

Straight Skeletons by Means of Voronoi Diagrams Under Polyhedral Distance Functions.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Order types and cross-sections of line arrangements in R^3.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Graph Drawings with Relative Edge Length Specifications.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Packing Plane Spanning Trees and Paths in Complete Geometric Graphs.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Non-Shellable Drawings of Kn with Few Crossings.
Proceedings of the 26th Canadian Conference on Computational Geometry, 2014

Einführung in die angewandte Geometrie.
Mathematik Kompakt, Birkhäuser, ISBN: 978-3-0346-0143-6, 2014

2013
Flip Graphs of Bounded Degree Triangulations.
Graphs and Combinatorics, 2013

Balanced 6-holes in linearly separable bichromatic point sets.
Electronic Notes in Discrete Mathematics, 2013

More on the crossing number of Kn: Monotone drawings.
Electronic Notes in Discrete Mathematics, 2013

The 2-Page Crossing Number of Kn.
Discrete & Computational Geometry, 2013

Extremal antipodal polygons and polytopes
CoRR, 2013

Empty triangles in good drawings of the complete graph.
CoRR, 2013

Flips in combinatorial pointed pseudo-triangulations with face degree at most four.
CoRR, 2013

Monotone Simultaneous Embedding of Directed Paths.
CoRR, 2013

Geodesic-Preserving Polygon Simplification.
CoRR, 2013

Linear transformation distance for bichromatic matchings.
CoRR, 2013

Shellable drawings and the cylindrical crossing number of $K_n$.
CoRR, 2013

Extreme point and halving edge search in abstract order types.
Comput. Geom., 2013

Blocking Delaunay triangulations.
Comput. Geom., 2013

Maximizing maximal angles for plane straight-line graphs.
Comput. Geom., 2013

Geodesic-Preserving Polygon Simplification.
Proceedings of the Algorithms and Computation - 24th International Symposium, 2013

Flip Distance between Triangulations of a Simple Polygon is NP-Complete.
Proceedings of the Algorithms - ESA 2013, 2013

Cell-Paths in Mono- and Bichromatic Line Arrangements in the Plane.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Theta-3 is connected.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

Covering Folded Shapes.
Proceedings of the 25th Canadian Conference on Computational Geometry, 2013

2012
Empty Monochromatic Simplices
CoRR, 2012

Flip Distance Between Triangulations of a Simple Polygon is NP-Complete
CoRR, 2012

The 2-page crossing number of Kn
CoRR, 2012

Pointed drawings of planar graphs.
Comput. Geom., 2012

On k-convex polygons.
Comput. Geom., 2012

The 2-page crossing number of Kn.
Proceedings of the Symposuim on Computational Geometry 2012, 2012

Geodesic Order Types.
Proceedings of the Computing and Combinatorics - 18th Annual International Conference, 2012

Lower Bounds for the Number of Small Convex k-Holes.
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

What makes a Tree a Straight Skeleton?
Proceedings of the 24th Canadian Conference on Computational Geometry, 2012

2011
Computational and Structural Advantages of Circular Boundary Representation.
Int. J. Comput. Geometry Appl., 2011

There is a unique crossing-minimal rectilinear drawing of K18.
Electronic Notes in Discrete Mathematics, 2011

On 5-Gons and 5-Holes.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Convexifying Monotone Polygons while Maintaining Internal Visibility.
Proceedings of the Computational Geometry - XIV Spanish Meeting on Computational Geometry, 2011

Triangulations with Circular Arcs.
Proceedings of the Graph Drawing - 19th International Symposium, 2011

On k-Gons and k-Holes in Point Sets.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

Convexifying Polygons Without Losing Visibilities.
Proceedings of the 23rd Annual Canadian Conference on Computational Geometry, 2011

2010
Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons.
SIAM J. Discrete Math., 2010

Edge-Removal and Non-Crossing Configurations in Geometric Graphs.
Discrete Mathematics & Theoretical Computer Science, 2010

On k-Convex Polygons
CoRR, 2010

Divide-and-conquer for Voronoi diagrams revisited.
Comput. Geom., 2010

Playing Pylos with an autonomous robot.
Proceedings of the 2010 IEEE/RSJ International Conference on Intelligent Robots and Systems, 2010

Compatible pointed pseudo-triangulations.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Blocking delaunay triangulations.
Proceedings of the 22nd Annual Canadian Conference on Computational Geometry, 2010

Exact Medial Axis Computation for Circular Arc Boundaries.
Proceedings of the Curves and Surfaces, 2010

Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics.
Proceedings of the Curves and Surfaces, 2010

2009
Flip Graphs of Bounded-Degree Triangulations.
Electronic Notes in Discrete Mathematics, 2009

New results on lower bounds for the number of (<=k)-facets.
Eur. J. Comb., 2009

Empty monochromatic triangles.
Comput. Geom., 2009

Compatible geometric matchings.
Comput. Geom., 2009

On minimum weight pseudo-triangulations.
Comput. Geom., 2009

Editorial.
Comput. Geom., 2009

Improved upper bounds on the reflexivity of point sets.
Comput. Geom., 2009

Recovering Structure from r-Sampled Objects.
Comput. Graph. Forum, 2009

Medial axis computation for planar free-form shapes.
Computer-Aided Design, 2009

Plane Graphs with Parity Constraints.
Proceedings of the Algorithms and Data Structures, 11th International Symposium, 2009

Divide-and-conquer for Voronoi diagrams revisited.
Proceedings of the 25th ACM Symposium on Computational Geometry, 2009

2008
On the number of pseudo-triangulations of certain point sets.
J. Comb. Theory, Ser. A, 2008

Compatible Geometric Matchings.
Electronic Notes in Discrete Mathematics, 2008

Triangulations without pointed spanning trees.
Comput. Geom., 2008

Matching edges and faces in polygonal partitions.
Comput. Geom., 2008

Empty Monochromatic Triangles.
Proceedings of the 20th Annual Canadian Conference on Computational Geometry, 2008

2007
Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-Triangles.
Graphs and Combinatorics, 2007

On the Number of Plane Geometric Graphs.
Graphs and Combinatorics, 2007

Gray Code Enumeration of Plane Straight-Line Graphs.
Graphs and Combinatorics, 2007

New results on lower bounds for the number of (k)-facets: (extended abstract).
Electronic Notes in Discrete Mathematics, 2007

New Lower Bounds for the Number of (<=k)-Edges and the Rectilinear Crossing Number of Kn.
Discrete & Computational Geometry, 2007

Pre-Triangulations and Liftable Complexes.
Discrete & Computational Geometry, 2007

Connecting colored point sets.
Discrete Applied Mathematics, 2007

Maximizing Maximal Angles for Plane Straight-Line Graphs
CoRR, 2007

A quadratic distance bound on sliding between crossing-free spanning trees.
Comput. Geom., 2007

Abstract order type extension and new results on the rectilinear crossing number.
Comput. Geom., 2007

Maximizing Maximal Angles for Plane Straight-Line Graphs.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Computational and Structural Advantages of Circular Boundary Representation.
Proceedings of the Algorithms and Data Structures, 10th International Workshop, 2007

Pointed Drawings of Planar Graphs.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

On (Pointed) Minimum Weight Pseudo-Triangulations.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

Improved Upper Bounds on the Reflexivity of Point Sets.
Proceedings of the 19th Annual Canadian Conference on Computational Geometry, 2007

2006
Transforming spanning trees and pseudo-triangulations.
Inf. Process. Lett., 2006

On the Crossing Number of Complete Graphs.
Computing, 2006

On the number of plane graphs.
Proceedings of the Seventeenth Annual ACM-SIAM Symposium on Discrete Algorithms, 2006

Decompositions, Partitions, and Coverings with Convex Polygons and Pseudo-triangles.
Proceedings of the Mathematical Foundations of Computer Science 2006, 2006

Pre-triangulations and liftable complexes.
Proceedings of the 22nd ACM Symposium on Computational Geometry, 2006

2005
Games on triangulations.
Theor. Comput. Sci., 2005

Abstract order type extension and new results on the rectilinear crossing number.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

On pseudo-convex decompositions, partitions, and coverings.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Transforming spanning trees and pseudo-triangulations.
Proceedings of the (Informal) Proceedings of the 21st European Workshop on Computational Geometry, 2005

Abstract order type extension and new results on the rectilinear crossing number.
Proceedings of the 21st ACM Symposium on Computational Geometry, 2005

Matching Edges and Faces in Polygonal Partitions.
Proceedings of the 17th Canadian Conference on Computational Geometry, 2005

2004
Quickest Paths, Straight Skeletons, and the City Voronoi Diagram.
Discrete & Computational Geometry, 2004

A lower bound on the number of triangulations of planar point sets.
Comput. Geom., 2004

Convexity minimizes pseudo-triangulations.
Comput. Geom., 2004

2003
Towards compatible triangulations.
Theor. Comput. Sci., 2003

Pseudotriangulations from Surfaces and a Novel Type of Edge Flip.
SIAM J. Comput., 2003

Long proteins with unique optimal foldings in the H-P model.
Comput. Geom., 2003

The Zigzag Path of a Pseudo-Triangulation.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Adapting (Pseudo)-Triangulations with a Near-Linear Number of Edge Flips.
Proceedings of the Algorithms and Data Structures, 8th International Workshop, 2003

Spatial embedding of pseudo-triangulations.
Proceedings of the 19th ACM Symposium on Computational Geometry, 2003

On the Number of Pseudo-Triangulations of Certain Point Sets.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

Degree Bounds for Constrained Pseudo-Triangulations.
Proceedings of the 15th Canadian Conference on Computational Geometry, 2003

2002
Enumerating Order Types for Small Point Sets with Applications.
Order, 2002

On Flips in Polyhedral Surfaces.
Int. J. Found. Comput. Sci., 2002

Long Proteins with Unique Optimal Foldings in the H-P Model
CoRR, 2002

Sequences of spanning trees and a fixed tree theorem.
Comput. Geom., 2002

Playing with Triangulations.
Proceedings of the Discrete and Computational Geometry, Japanese Conference, 2002

Quickest paths, straight skeletons, and the city Voronoi diagram.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

On the crossing number of complete graphs.
Proceedings of the 18th Annual Symposium on Computational Geometry, Barcelona, 2002

Convexity minimizes pseudo-triangulations.
Proceedings of the 14th Canadian Conference on Computational Geometry, 2002

2001
Generalized self-approaching curves.
Discrete Applied Mathematics, 2001

Reconfiguring convex polygons.
Comput. Geom., 2001

Enumerating order types for small sets with applications.
Proceedings of the Seventeenth Annual Symposium on Computational Geometry, 2001

Towards Compatible Triangulations.
Proceedings of the Computing and Combinatorics, 7th Annual International Conference, 2001

The point set order type data base: A collection of applications and results.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

On the number of triangulations every planar point set must have.
Proceedings of the 13th Canadian Conference on Computational Geometry, 2001

2000
Flipturning polygons
CoRR, 2000

Edge Operations on Non-Crossing Spanning Trees.
EuroCG, 2000

Reconfiguring Convex Polygons.
Proceedings of the 12th Canadian Conference on Computational Geometry, 2000

1999
New Results on MWT Subgraphs.
Inf. Process. Lett., 1999

Skew Voronoi Diagrams.
Int. J. Comput. Geometry Appl., 1999

The Path of a Triangulation.
Proceedings of the Fifteenth Annual Symposium on Computational Geometry, 1999

1998
Constant-Level Greedy Triangulations Approximate the MWT Well.
J. Comb. Optim., 1998

Generalized Self-Approaching Curves.
Proceedings of the Algorithms and Computation, 9th International Symposium, 1998

1997
Matching Shapes with a Reference Point.
Int. J. Comput. Geometry Appl., 1997

Voronoi Diagrams for Direction-Sensitive Distances.
Proceedings of the Thirteenth Annual Symposium on Computational Geometry, 1997

1996
Classifying Hyperplanes in Hypercubes.
SIAM J. Discrete Math., 1996

Triangulations Intersect Nicely.
Discrete & Computational Geometry, 1996

Straight Skeletons for General Polygonal Figures in the Plane.
Proceedings of the Computing and Combinatorics, Second Annual International Conference, 1996

1995
A Novel Type of Skeleton for Polygons.
J. UCS, 1995

Triangulations Intersect Nicely.
Proceedings of the Eleventh Annual Symposium on Computational Geometry, 1995

1994
Matching Shapes with a Reference Point.
Proceedings of the Tenth Annual Symposium on Computational Geometry, 1994


  Loading...