Acute triangulations of polygons
From MaRDI portal
Publication:5896799
DOI10.1007/S00454-005-1184-0zbMATH Open1084.68134OpenAlexW2060579930WikidataQ56813978 ScholiaQ56813978MaRDI QIDQ5896799FDOQ5896799
Authors: Ileana Streinu 
Publication date: 2 March 2006
Published in: Discrete \& Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s00454-005-1184-0
Recommendations
Cited In (29)
- Pointed spherical tilings and hyperbolic virtual polytopes
- Enumerating non-crossing minimally rigid frameworks
- Title not available (Why is that?)
- Title not available (Why is that?)
- Title not available (Why is that?)
- Visibility-preserving convexifications using single-vertex moves
- Minimal Locked Trees
- Multitriangulations, pseudotriangulations and primitive sorting networks
- Flattening single-vertex origami: The non-expansive case
- Recognizing planar Laman graphs
- Pointed binary encompassing trees: simple and optimal
- Graph Drawing
- Pointed drawings of planar graphs
- Enumerating constrained non-crossing minimally rigid frameworks
- Triangulations without pointed spanning trees
- On numbers of pseudo-triangulations
- Acute and nonobtuse triangulations of polyhedral surfaces
- Morphing polyhedra with parallel faces: Counterexamples
- Title not available (Why is that?)
- Relative convex hulls in semi-dynamic arrangements
- Augmenting the rigidity of a graph in \(\mathbb R^{2}\)
- Locked and unlocked chains of planar shapes
- On the number of pseudo-triangulations of certain point sets
- Resolving Loads with Positive Interior Stresses
- Convex partitions with 2-edge connected dual graphs
- Acute triangulations of flat tori
- A vertex-face assignment for plane graphs
- Acute Triangulation of a Triangle in a General Setting
- Flips in edge-labelled pseudo-triangulations
This page was built for publication: Acute triangulations of polygons
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5896799)
