On the visibility graph of convex translates
From MaRDI portal
Publication:5951963
Graph theory (including graph drawing) in computer science (68R10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computational aspects related to convexity (52B55) Eulerian and Hamiltonian graphs (05C45) Edge subsets with special properties (factorization, matching, partitioning, covering and packing, etc.) (05C70)
Recommendations
Cites work
- scientific article; zbMATH DE number 1033560 (Why is no real title available?)
- scientific article; zbMATH DE number 1049272 (Why is no real title available?)
- A linear algorithm for finding Hamiltonian cycles in 4-connected maximal planar graphs
- Computational Geometry in C
- Computing Simple Circuits from a Set of Line Segments is NP-Complete
- Convex Polygons
- Graph theory
- Growing a Tree from Its Branches
- Hamiltonian cycles in planar triangulations with no separating triangles
- Hamiltonian triangulations and circumscribing polygons of disjoint line segments
- On the perfect matching of disjoint compact sets by noncrossing line segments in \(\mathbb R^n\)
Cited in
(4)
This page was built for publication: On the visibility graph of convex translates
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5951963)