Výsledky vyhledávání - "Vahrenhold, J."

Rotated-box trees: A lightweight c-oriented bounding-volume hierarchy

Autor: Berg, de, M.T., Hachenberger, P., Vahrenhold, J.

Publikováno v: Experimental Algorithms (8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings), 63-75
STARTPAGE=63;ENDPAGE=75;TITLE=Experimental Algorithms (8th International Symposium, SEA 2009, Dortmund, Germany, June 4-6, 2009. Proceedings)
Experimental Algorithms ISBN: 9783642020100
SEA

We introduce a new type of bounding-volume hierarchy, the c-oriented rotated-box tree, or c-rb-tree for short. A c-rb-tree uses boxes as bounding volumes, whose orientations come from a fixed set of predefined box orientations. We theoretically and e

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::4c8304afbd421d42b2bd576dc01a009c
https://doi.org/10.1007/978-3-642-02011-7_8

Zobrazit plný text záznamu

Recursive tilings and space-filling curves with little fragmentation

Autor: Haverkort, H.J., Vahrenhold, J.

Publikováno v: Abstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010), 185-188
STARTPAGE=185;ENDPAGE=188;TITLE=Abstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010)

This paper defines the Arrwwid number of a recursive tiling (or space-filling curve) as the smallest number a such that any ball Q can be covered by a tiles (or curve fragments) with total volume O(volume(Q)). Recursive tilings and space-filling curv

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::839892ac7584ccb6b96e0cc5a36a5184
https://research.tue.nl/nl/publications/09a8cbb6-e327-4678-a197-461a546605bb

Zobrazit plný text záznamu

Hide-and-seek: a linear time algorithm for polygon walk problems

Autor: Cook IV, A.F., Fan, C., Luo, J., Vahrenhold, J.

Publikováno v: Abstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010), 121-124
STARTPAGE=121;ENDPAGE=124;TITLE=Abstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010)

Jack and Jill have decided to play hide-and-seek along the boundary of a simple polygon. To start the game, Jack and Jill each choose an arbitrary path on this boundary. After fixing these paths, our goal is to determine whether Jack can control his

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::f25ffcae632e99a9cea82f26b237b7ad
https://research.tue.nl/nl/publications/2a73591e-bdbd-44a5-93bc-fb1ebb74d1e2

Zobrazit plný text záznamu

Hiding in the crowd: asympstotic bounds on blocking sets

Autor: Jovanovic, N., Korst, J.H.M., Aleksovski, Z., Jovanovic, R., Vahrenhold, J.

Publikováno v: Abstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010), 197-200
STARTPAGE=197;ENDPAGE=200;TITLE=Abstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010)

We consider the problem of blocking all rays emanating from a unit disk U by a minimum number N_d of unit disks in the two-dimensional space, where each disk has at least a distance d to any other disk. We study the asymptotic behavior of N_d, as d t

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::e5075ad803fc38bd8a3c04bebc03e66f
https://research.tue.nl/nl/publications/58e7355a-354f-4a7a-a625-639bd95d56ff

Zobrazit plný text záznamu

Steinitz theorems for orthogonal polyhedra

Autor: Eppstein, D., Mumford, E., Vahrenhold, J.

Publikováno v: Abstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010), 145-148
STARTPAGE=145;ENDPAGE=148;TITLE=Abstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010)

No abstract.

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::7ee5b45bdf74d58907a9c926d290ffc9
https://research.tue.nl/nl/publications/d6707fd4-9fdb-41b3-a5bc-1e98c4b9c17c

Zobrazit plný text záznamu

How Alexander the Great brought the Greeks together while inflicting minimal damage to the Barbarians

Autor: Berg, de, M.T., Gerrits, D.H.P., Khosravi Dehkordi, A., Rutter, I., Tsirogiannis, C.P., Wolff, A., Vahrenhold, J.

Publikováno v: Abstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010), 73-76
STARTPAGE=73;ENDPAGE=76;TITLE=Abstracts 26th European Workshop on Computational Geometry (EuroCG 2010, Dortmund, Germany, March 22-24, 2010)

Let R be a finite set of red point sites in R^d and let B be a set of n blue point sites in R^d. We want to establish "safe" connections between the red sites by deleting a minimum number of blue sites such that the region controlled by the red sites

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=narcis______::1611045cfc25780ed7436db67f5cb906
https://research.tue.nl/nl/publications/1ad6af87-98e3-447e-8ed3-bf789b85a4f2

Zobrazit plný text záznamu

Vyhledávací nástroje:

Upřesnit hledání