Zobrazeno 1 - 10
of 320
pro vyhledávání: '"Theory of computation → Computational geometry"'
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
Autor:
Ezra, Esther, Sharir, Micha
Publikováno v:
SIAM Journal on Computing. 51:1065-1095
We consider several problems that involve lines in three dimensions, and present improved algorithms for solving them. The problems include (i) ray shooting amid triangles in $R^3$, (ii) reporting intersections between query lines (segments, or rays)
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::6d31148de066d32eb710bbf82b99eebf
https://doi.org/10.1137/21m1408245
https://doi.org/10.1137/21m1408245
Akademický článek
Tento výsledek nelze pro nepřihlášené uživatele zobrazit.
K zobrazení výsledku je třeba se přihlásit.
K zobrazení výsledku je třeba se přihlásit.
We study the query version of the approximate heavy hitter and quantile problems. In the former problem, the input is a parameter ε and a set P of n points in ℝ^d where each point is assigned a color from a set C, and the goal is to build a struct
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b0ad27c2d7ebf2bc895037e40a958ac
http://arxiv.org/abs/2305.03180
http://arxiv.org/abs/2305.03180
Publikováno v:
Leibniz International Proceedings in Informatics (LIPIcs)
39th International Symposium on Computational Geometry (SoCG 2023)
39th International Symposium on Computational Geometry (SoCG 2023), Jun 2023, Dallas, United States. pp.27:1--27:15, ⟨10.4230/LIPIcs.SoCG.2023.27⟩
39th International Symposium on Computational Geometry (SoCG 2023)
39th International Symposium on Computational Geometry (SoCG 2023), Jun 2023, Dallas, United States. pp.27:1--27:15, ⟨10.4230/LIPIcs.SoCG.2023.27⟩
The goal of this paper is to exhibit and analyze an algorithm that takes a given closed orientable hyperbolic surface and outputs an explicit Dirichlet domain. The input is a fundamental polygon with side pairings. While grounded in topological consi
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::9b5405e45df453c94c7c5ee2af802601
https://hal.science/hal-03881015/file/HAL.pdf
https://hal.science/hal-03881015/file/HAL.pdf
Clearing is a simple but effective optimization for the standard algorithm of persistent homology, which dramatically improves the speed and scalability of persistent homology computations for Vietoris--Rips filtrations. Due to the quick growth of th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::b4a4bc43c7c6c486a403bf765d3f4b02
http://arxiv.org/abs/2303.11193
http://arxiv.org/abs/2303.11193
Autor:
Alonso, Ángel Javier, Kerber, Michael
We study the decomposition of zero-dimensional persistence modules, viewed as functors valued in the category of vector spaces factorizing through sets. Instead of working directly at the level of vector spaces, we take a step back and first study th
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::875fe59b20e7d30795f61a813b2ce460
http://arxiv.org/abs/2303.06118
http://arxiv.org/abs/2303.06118
Publikováno v:
39th International Symposium on Computational Geometry
A finite set P of points in the plane is n-universal with respect to a class C of planar graphs if every n-vertex graph in C admits a crossing-free straight-line drawing with vertices at points of P. For the class of all planar graphs the best known
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::298e48f2a48565019cd6bf9f458cc4db
http://arxiv.org/abs/2303.00109
http://arxiv.org/abs/2303.00109
Autor:
Chan, Timothy M.
Publikováno v:
Discrete & Computational Geometry.
We revisit a classical problem in computational geometry: finding the largest-volume axis-aligned empty box (inside a given bounding box) amidst $n$ given points in $d$ dimensions. Previously, the best algorithms known have running time $O(n\log^2n)$
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3634d7fa4724a48825a90a8d88dcfdab
https://doi.org/10.1007/s00454-022-00473-x
https://doi.org/10.1007/s00454-022-00473-x