On realistic terrains
From MaRDI portal
Publication:934023
DOI10.1016/j.comgeo.2007.10.008zbMath1152.65034OpenAlexW2202869537MaRDI QIDQ934023
A. Frank van der Stappen, Esther Moet, Marc J. van Kreveld
Publication date: 29 July 2008
Published in: Computational Geometry (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.comgeo.2007.10.008
Analysis of algorithms and problem complexity (68Q25) Numerical aspects of computer graphics, image analysis, and computational geometry (65D18) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Complexity and performance of numerical algorithms (65Y20)
Related Items
Space complexity of exact discrete geodesic algorithms on regular triangulations, Geometric matching algorithms for two realistic terrains, The complexity of flow on fat terrains and its i/o-efficient computation
Cites Work
- Unnamed Item
- Nonoverlap of the star unfolding
- Approximate motion planning and the complexity of the boundary of the union of simple geometric figures
- Efficient hidden surface removal for objects with small union size
- Motion planning in environments with low obstacle density
- Range searching in low-density environments
- On fat partitioning, fat covering and the union size of polygons
- Linear size binary space partitions for uncluttered scenes
- Models and motion planning
- Local polyhedra and geometric graphs
- The complexity of the free space for motion planning amidst fat obstacles
- Realistic input models for geometric algorithms
- Efficient computation of geodesic shortest paths
- The Discrete Geodesic Problem
- Smoothed analysis of algorithms
- Range Searching and Point Location among Fat Objects
- Fat Triangles Determine Linearly Many Holes
- SHORTEST PATHS ON A POLYHEDRON, Part I: COMPUTING SHORTEST PATHS
- The Complexity of the Union of $(\alpha,\beta)$-Covered Objects
- On the union of κ-round objects
- Vertical ray shooting for fat objects
- Algorithms and Data Structures
