Recognizing Geometric Trees as Positively Weighted Straight Skeletons and Reconstructing Their Input
DOI10.1142/S0218195919500080zbMATH Open1493.68372OpenAlexW2981998334WikidataQ126985693 ScholiaQ126985693MaRDI QIDQ5241380FDOQ5241380
Authors: Günther Eder, M. Held, Peter Palfrader 
Publication date: 31 October 2019
Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1142/s0218195919500080
Recommendations
- Reconstruction of the geometric structure of a set of points in the plane from its geometric tree graph
- Representing directed trees as straight skeletons
- Reconstructing trees from digitally convex sets
- Geometry of weighted recursive and affine preferential attachment trees
- Tree fitting: Topological recognition from ordinary least-squares edge length estimates
- Phylogenetic tree reconstruction: geometric approaches
- Reconstruction of rooted directed trees
- Orthogeodesic point-set embedding of trees
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)
Cites Work
- Title not available (Why is that?)
- Raising roofs, crashing cycles, and playing pool: Applications of a data structure for finding pairwise interactions
- Weighted straight skeletons in the plane
- Title not available (Why is that?)
- Motorcycle graphs and straight skeletons
- A fast straight-skeleton algorithm based on generalized motorcycle graphs
- Computing positively weighted straight skeletons of simple polygons based on a bisector arrangement
- A faster algorithm for computing straight skeletons
- Representing directed trees as straight skeletons
Cited In (3)
This page was built for publication: Recognizing Geometric Trees as Positively Weighted Straight Skeletons and Reconstructing Their Input
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5241380)
