Výsledky vyhledávání - "M.T. de Berg"

An Efficient Algorithm for the 1D Total Visibility-Index Problem

Autor: H. Casanovaz, M.T. de Berg, Constantinos Tsirogiannis, N. Sitchinavaz, C. Lambrechts, Peyman Afshani, Ben Karsin

Publikováno v: ALENEX
Afshani, P, De Berg, M, Casanova, H, Karsin, B, Lambrechts, C, Sitchinava, N & Tsirogiannis, C 2017, An efficient algorithm for the 1D total visibility-index problem . in S Fekete & V Ramachandran (eds), 2017 Proceedings of the Ninteenth Workshop on Algorithm Engineering and Experiments (ALENEX) . vol. PRAL17, Society for Industrial and Applied Mathematics, pp. 218-231, 19th Workshop on Algorithm Engineering and Experiments 2017, ALENEX 2017, Barcelona, Spain, 17/01/2017 . https://doi.org/10.1137/1.9781611974768.18

Let T be a terrain, and let P be a set of points (locations) on its surface. An important problem in Geographic Information Science (GIS) is computing the visibility index of a point p on P, that is, the number of points in P that are visible from p.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::eaadcdef18bc7506f0b8f99320f60ee4
https://doi.org/10.1137/1.9781611974768.18

Zobrazit plný text záznamu

On R-trees with low query complexity

Autor: Joachim Gudmundsson, Mikael Hammar, M.T. de Berg, Mark H. Overmars

Publikováno v: Computational Geometry, 24(3), 179-195. Elsevier

The R-tree is a well-known bounding-volume hierarchy that is suitable for storing geometric data on secondary memory. Unfortunately, no good analysis of its query time exists. We describe a new algorithm to construct an R-tree for a set of planar obj

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::50d4e84bfe5612833555250823bbb874

Zobrazit plný text záznamu

SHORTEST PATH QUERIES IN RECTILINEAR WORLDS

Autor: M.J. van Kreveld, M.T. de Berg, Mark H. Overmars, Bengt J. Nilsson

Publikováno v: International Journal of Computational Geometry & Applications. :287-309

In this paper, a data structure is given for two and higher dimensional shortest path queries. For a set of n axis-parallel rectangles in the plane, or boxes in d-space, and a fixed target, it is possible with this structure to find a shortest rectil

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::ae07b9dee112a5b7ef39f0f67b3c0dfa
https://doi.org/10.1142/s0218195992000172

Zobrazit plný text záznamu

Efficient ray shooting and hidden surface removal

Autor: M.J. van Kreveld, Mark H. Overmars, Jack Snoeyink, Dan Halperin, M.T. de Berg

Publikováno v: Symposium on Computational Geometry
Proceedings 7th Annual ACM Symposium on Computational Geometry (North Conway NH, USA, June 10-12, 1991), 21-30
STARTPAGE=21;ENDPAGE=30;TITLE=Proceedings 7th Annual ACM Symposium on Computational Geometry (North Conway NH, USA, June 10-12, 1991)
Scopus-Elsevier
Algorithmica, 12(1), 30-53. Springer

In this paper we study the ray-shooting problem for three special classes of polyhedral objects in space: axis-parallel polyhedra, curtains (unbounded polygons with three edges, two of which are parallel to thez-axis and extend downward to minus infi

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::edda05ee32b110691434a9abd340c695
https://doi.org/10.1145/109648.109651

Zobrazit plný text záznamu

Hidden surface removal for axis-parallel polyhedra

Autor: M.T. de Berg, Mark H. Overmars

Publikováno v: Proceedings 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS, St. Louis MO, USA, October 22-24, 1990), 252-261
STARTPAGE=252;ENDPAGE=261;TITLE=Proceedings 31st Annual IEEE Symposium on Foundations of Computer Science (FOCS, St. Louis MO, USA, October 22-24, 1990)

An efficient, output-sensitive method for computing the visibility map of a set of axis-parallel polyhedra (i.e. polyhedra with their faces and edges parallel to the coordinate axes) as seen from a given viewpoint is introduced. For nonintersecting p

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::8602751f38d529e40f6bcdd76dd71d0c
https://research.tue.nl/en/publications/977c9185-abff-4ae2-ad12-cb478d0aee00

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání