[图书][B] Handbook of discrete and computational geometry
CD Toth, J O'Rourke, JE Goodman - 2017 - books.google.com
The Handbook of Discrete and Computational Geometry is intended as a reference book
fully accessible to nonspecialists as well as specialists, covering all major aspects of both …
fully accessible to nonspecialists as well as specialists, covering all major aspects of both …
Local curvature entropy-based 3D terrain representation using a comprehensive Quadtree
Large scale 3D digital terrain modeling is a crucial part of many real-time applications in
geoinformatics. In recent years, the improved speed and precision in spatial data collection …
geoinformatics. In recent years, the improved speed and precision in spatial data collection …
Computing the visibility graph of points within a polygon
B Ben-Moshe, O Hall-Holt, MJ Katz… - Proceedings of the …, 2004 - dl.acm.org
We study the problem of computing the visibility graph defined by a set P of n points inside a
polygon Q: two points p, q ε P are joined by an edge if the segment‾ pq⊂ Q. Efficient output …
polygon Q: two points p, q ε P are joined by an edge if the segment‾ pq⊂ Q. Efficient output …
Efficient viewshed computation on terrain in external memory
MVA Andrade, SVG Magalhaes, MA Magalhaes… - GeoInformatica, 2011 - Springer
The recent availability of detailed geographic data permits terrain applications to process
large areas at high resolution. However the required massive data processing presents …
large areas at high resolution. However the required massive data processing presents …
Geographic information systems
M van Kreveld - Handbook of Discrete and Computational …, 2017 - taylorfrancis.com
Geographic information systems (GIS) facilitate the input, storage, manipulation, analysis,
and visualization of geographic data. Geographic data generally has a location, size, shape …
and visualization of geographic data. Geographic data generally has a location, size, shape …
Tradeoffs when multiple observer siting on large terrain cells
WR Franklin, C Vogt - Progress in spatial data handling: 12th international …, 2006 - Springer
This paper demonstrates a toolkit for multiple observer siting to maximize their joint
viewshed, on high-resolution gridded terrains, up to 2402× 2402, with the viewsheds' radii of …
viewshed, on high-resolution gridded terrains, up to 2402× 2402, with the viewsheds' radii of …
Orthogonal segment stabbing
MJ Katz, JSB Mitchell, Y Nir - Computational Geometry, 2005 - Elsevier
We study a class of geometric stabbing/covering problems for sets of line segments, rays
and lines in the plane. While we demonstrate that the problems on sets of horizontal/vertical …
and lines in the plane. While we demonstrate that the problems on sets of horizontal/vertical …
On the complexity of minimum-link path problems
We revisit the minimum-link path problem: Given a polyhedral domain and two points in it,
connect the points by a polygonal path with minimum number of edges. We consider …
connect the points by a polygonal path with minimum number of edges. We consider …
Surface compression using over-determined Laplacian approximation
Z Xie, WR Franklin, B Cutler… - Advanced Signal …, 2007 - spiedigitallibrary.org
We describe a surface compression technique to lossily compress elevation datasets. Our
approach first approximates the uncompressed terrain using an over-determined system of …
approach first approximates the uncompressed terrain using an over-determined system of …
Feature-based visibility-driven CLOD for terrain
S Li, X Liu, E Wu - 11th Pacific Conference onComputer …, 2003 - ieeexplore.ieee.org
View-dependent level-of-detail (LOD) and visibility culling are two powerful tools for
accelerating the rendering of very large models in a real-time visualization, especially in …
accelerating the rendering of very large models in a real-time visualization, especially in …