The Complexity of Angular Resolution
From MaRDI portal
Recommendations
- A Note on Rectilinearity and Angular Resolution
- The complexity of resolution refinements
- Statistical Angular Resolution Limit for Point Sources
- Angular Resolutions: Around Vertices and Crossings
- Resolution in rotation measurements
- Graphs with large total angular resolution
- Graphs with large total angular resolution
- scientific article; zbMATH DE number 2066323
- On the Angular Resolution Limit for Array Processing in the Presence of Modeling Errors
Cites work
- A Note on Rectilinearity and Angular Resolution
- Angular Resolutions: Around Vertices and Crossings
- Completeness for the complexity class \(\forall \exists \mathbb{R}\) and area-universality
- Complexity of geometric \(k\)-planarity for fixed \(k\)
- Complexity of some geometric and topological problems
- Drawing Cubic Graphs with the Four Basic Slopes
- Drawing Graphs in the Plane with High Resolution
- Fixed points, Nash equilibria, and the existential theory of the reals
- scientific article; zbMATH DE number 17663 (Why is no real title available?)
- On Embedding a Graph in the Grid with the Minimum Number of Bends
- On the complexity of the planar slope number problem
- RAC-drawability is \(\exists \mathbb{R} \)-complete
- Simple realizability of complete abstract topological graphs in P
- The Art Gallery Problem is ∃ℝ-complete
- The Minimal Polynomial of cos(2π/n)
Cited in
(14)- The crossing-angle resolution in graph drawing
- Optimal angular resolution for face-symmetric drawings
- On the Angular Resolution of Planar Graphs
- Computing the Angularity Tolerance
- On the Efficiency of Angular Intraprediction
- A Note on Rectilinearity and Angular Resolution
- Angle covers: algorithms and complexity
- On the Capacity of the Precision-Resolution System
- Resolution in rotation measurements
- Graphs with large total angular resolution
- Graphs with large total angular resolution
- RAC-Drawability is ∃ℝ-complete and Related Results
- Beyond the Existential Theory of the Reals
- Bounds on the crossing resolution of complete geometric graphs
This page was built for publication: The Complexity of Angular Resolution
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6075714)
