The following pages link to Oswin Aichholzer (Q170468):
Displayed 50 items.
- Empty monochromatic simplices (Q2250050) (← links)
- Disjoint compatibility graph of non-crossing matchings of points in convex position (Q2263780) (← links)
- A superlinear lower bound on the number of 5-holes (Q2306008) (← links)
- Packing plane spanning graphs with short edges in complete geometric graphs (Q2331211) (← links)
- Reprint of: Theta-3 is connected (Q2341694) (← links)
- Empty triangles in good drawings of the complete graph (Q2345507) (← links)
- On the number of plane geometric graphs (Q2373434) (← links)
- New lower bounds for the number of \((\leq k)\)-edges and the rectilinear crossing number of \(K_{n}\) (Q2385147) (← links)
- Extreme point and halving edge search in abstract order types (Q2391543) (← links)
- The 2-page crossing number of \(K_{n}\) (Q2391708) (← links)
- Lower bounds for the number of small convex \(k\)-holes (Q2444312) (← links)
- 4-holes in point sets (Q2450200) (← links)
- Gray code enumeration of plane straight-line graphs (Q2464050) (← links)
- Decompositions, partitions, and coverings with convex polygons and pseudo-triangles (Q2464053) (← links)
- Pre-triangulations and liftable complexes (Q2471725) (← links)
- On the number of pseudo-triangulations of certain point sets (Q2474495) (← links)
- Triangulations without pointed spanning trees (Q2479476) (← links)
- Shellable drawings and the cylindrical crossing number of \(K_n\) (Q2514231) (← links)
- Games on triangulations (Q2570126) (← links)
- Packing plane spanning trees and paths in complete geometric graphs (Q2628273) (← links)
- Flip graphs of bounded degree triangulations (Q2637710) (← links)
- 3-Colorability of Pseudo-Triangulations (Q2792798) (← links)
- Flip Graphs of Bounded-Degree Triangulations (Q2851510) (← links)
- (Q2857403) (← links)
- Geodesic-Preserving Polygon Simplification (Q2872066) (← links)
- The 2-page crossing number of K <sub>n</sub> (Q2874601) (← links)
- Geodesic Order Types (Q2914326) (← links)
- Embedding Four-Directional Paths on Convex Point Sets (Q2936942) (← links)
- Reconstructing Point Set Order Typesfrom Radial Orderings (Q2942609) (← links)
- A Note on the Number of General 4-holes in (Perturbed) Grids (Q2958082) (← links)
- Representing Directed Trees as Straight Skeletons (Q2959768) (← links)
- Reconstructing Point Set Order Types from Radial Orderings (Q2988723) (← links)
- COMPUTATIONAL AND STRUCTURAL ADVANTAGES OF CIRCULAR BOUNDARY REPRESENTATION (Q3007723) (← links)
- ON FLIPS IN POLYHEDRAL SURFACES (Q3021956) (← links)
- Large Bichromatic Point Sets Admit Empty Monochromatic 4-Gons (Q3058550) (← links)
- Exact Medial Axis Computation for Triangulated Solids with Respect to Piecewise Linear Metrics (Q3111666) (← links)
- Exact Medial Axis Computation for Circular Arc Boundaries (Q3111667) (← links)
- An improved lower bound on the minimum number of triangulations (Q3132839) (← links)
- An Optimal Algorithm for Reconstructing Point Set Order Types from Radial Orderings (Q3459888) (← links)
- Embedding Four-directional Paths on Convex Point Sets (Q3460400) (← links)
- New results on lower bounds for the number of (⩽ k)-facets (Q3503472) (← links)
- (Q3575470) (← links)
- Einführung in die angewandte Geometrie (Q3579928) (← links)
- On the number of plane graphs (Q3581579) (← links)
- (Q3601550) (← links)
- Computational and Structural Advantages of Circular Boundary Representation (Q3603542) (← links)
- (Q3625834) (← links)
- Matching Shapes with a Reference Point (Q4354007) (← links)
- Pseudotriangulations from Surfaces and a Novel Type of Edge Flip (Q4441896) (← links)
- (Q4509205) (← links)