Zobrazeno 1 - 5
of 5
pro vyhledávání: '"Buchin, K.A."'
Autor:
Buchin, K.A., Diez, Y., van Diggelen, T.W.T., Meulemans, W., Ravada, Siva, Hoel, Erik, Tamassia, Roberto, Newsam, Shawn, Trajcevski, Goce
Publikováno v:
Proceedings of the 25th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems (ACM GIS)
SIGSPATIAL/GIS
SIGSPATIAL/GIS
Consider a set P of trajectories (polygonal lines in R2), and a query given by a trajectory Q and a threshold &epsis; > 0. To answer the query we wish to find all trajectories P ∈ P such that δF(P, Q) ≤ &epsis;, where δF denotes the Fréchet di
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::798f9c53a38d43fcda7862e62183982f
https://research.tue.nl/nl/publications/43659976-bdf5-420d-8e5e-fd82d770e088
https://research.tue.nl/nl/publications/43659976-bdf5-420d-8e5e-fd82d770e088
Publikováno v:
ISSUE=33;STARTPAGE=41;ENDPAGE=44;TITLE=33rd European Workshop on Computational Geometry (EuroCG 2017)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::273c3d080cb94e6f02a9655a3822dcd3
https://research.tue.nl/nl/publications/9667dc95-29fd-4637-a1ee-76b39f458df7
https://research.tue.nl/nl/publications/9667dc95-29fd-4637-a1ee-76b39f458df7
Autor:
Buchin, K.A., Chun, J., Markovic, A., Meulemans, W., Löffler, M., Okamoto, Y., Shiitada, T., Katz, Matthew J., Aronov, Boris
Publikováno v:
33rd International Symposium on Computational Geometry (SoCG 2017), 4-7 July 2017, Brisbane, Australia, 641-645
STARTPAGE=641;ENDPAGE=645;TITLE=33rd International Symposium on Computational Geometry (SoCG 2017), 4-7 July 2017, Brisbane, Australia
STARTPAGE=641;ENDPAGE=645;TITLE=33rd International Symposium on Computational Geometry (SoCG 2017), 4-7 July 2017, Brisbane, Australia
By folding the free-space diagram for efficient preprocessing, we show that the Fréchet distance between 1D curves can be computed in O(nk log n) time, assuming one curve has ply k.
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=narcis______::b6eaacaf49e465d75e8fcf5eaba487ff
https://research.tue.nl/nl/publications/e7d21589-be6e-466d-b95b-fa319110e9c3
https://research.tue.nl/nl/publications/e7d21589-be6e-466d-b95b-fa319110e9c3
Autor:
Abrahamsen, M., de Berg, M.T., Buchin, K.A., Mehr, M., Mehrabi, A.D., Katz, Matthew J., Aronov, Boris
Publikováno v:
Abrahamsen, M, de Berg, M, Buchin, K, Mehr, M & Mehrabi, A D 2017, Minimum perimeter-sum partitions in the plane . in B Aronov & M J Katz (eds), 33rd International Symposium on Computational Geometry (SoCG 2017) ., 4, Schloss Dagstuhl-Leibniz-Zentrum für Informatik, Leibniz International Proceedings in Informatics, vol. 77, 33rd International Symposium on Computational Geometry, Brisbane, Queensland, Australia, 04/07/2017 . https://doi.org/10.4230/LIPIcs.SoCG.2017.4
Discrete and Computational Geometry, 63(2), 483-505. Springer
arXiv. Cornell University Library
ISSUE=1703.05549;TITLE=arXiv
33rd International Symposium on Computational Geometry (SoCG 2017), 4-7 July 2017, Brisbane, Australia, 1-15
STARTPAGE=1;ENDPAGE=15;TITLE=33rd International Symposium on Computational Geometry (SoCG 2017), 4-7 July 2017, Brisbane, Australia
Pure TUe
Discrete and Computational Geometry, 63(2), 483-505. Springer
arXiv. Cornell University Library
ISSUE=1703.05549;TITLE=arXiv
33rd International Symposium on Computational Geometry (SoCG 2017), 4-7 July 2017, Brisbane, Australia, 1-15
STARTPAGE=1;ENDPAGE=15;TITLE=33rd International Symposium on Computational Geometry (SoCG 2017), 4-7 July 2017, Brisbane, Australia
Pure TUe
Let $P$ be a set of $n$ points in the plane. We consider the problem of partitioning $P$ into two subsets $P_1$ and $P_2$ such that the sum of the perimeters of $\text{CH}(P_1)$ and $\text{CH}(P_2)$ is minimized, where $\text{CH}(P_i)$ denotes the co
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6ffb64d2f1bcf6cb455fc3dc64347741
https://curis.ku.dk/ws/files/188450392/Abrahamsen_2017_Minimum_perimeter_sum.pdf
https://curis.ku.dk/ws/files/188450392/Abrahamsen_2017_Minimum_perimeter_sum.pdf
Publikováno v:
UPCommons. Portal del coneixement obert de la UPC
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Journal of Computational Geometry, Vol 7, Iss 1 (2016)
Journal of Computational Geometry, 7(1), 100-122. Macodrum library, Carleton University
Universitat Politècnica de Catalunya (UPC)
Recercat. Dipósit de la Recerca de Catalunya
instname
Journal of Computational Geometry, Vol 7, Iss 1 (2016)
Journal of Computational Geometry, 7(1), 100-122. Macodrum library, Carleton University
Rectangular layouts, subdivisions of an outer rectangle into smaller rectangles, have many applications in visualizing spatial information, for instance in rectangular cartograms in which the rectangles represent geographic or political regions. A sp
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::05dce4c32f1b0f43fb2d5f91db797f39