Bounds on the cost of compatible refinement of simplex decomposition trees in arbitrary dimensions

Autor: F. Betul Atalay, David M. Mount

Publikováno v: Computational Geometry. 79:14-29

A hierarchical simplicial mesh is a recursive decomposition of space into cells that are simplices. Such a mesh is compatible if pairs of neighboring cells meet along a single common face. Compatibility condition is important in many applications whe

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::04bac2b198e6a45442ae9cc32ae43bb5
https://doi.org/10.1016/j.comgeo.2019.01.004

A Game-Theoretic Approach for Minimizing Delays in Autonomous Intersections

Autor: Robert P. Adkins, David M. Mount, Alice A. Zhang

Publikováno v: Traffic and Granular Flow '17 ISBN: 9783030114398

Traffic management systems of the near future will be able to exploit communication between vehicles and autonomous traffic control systems to significantly improve the utilization of road networks. In this work, a novel game-theoretic model for the

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::bfc35ca66038c05aa42944feb5e91863
https://doi.org/10.1007/978-3-030-11440-4_16

Guarantees on nearest-neighbor condensation heuristics

Autor: David M. Mount, Alejandro Flores-Velazco

Publikováno v: Computational Geometry. 95:101732

The problem of nearest-neighbor condensation aims to reduce the size of a training set of a nearest-neighbor classifier while maintaining its classification accuracy. Although many condensation techniques have been proposed, few bounds have been prov

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_________::0390bf66e13c1df183f9c8ceac530a95
https://doi.org/10.1016/j.comgeo.2020.101732

On the Combinatorial Complexity of Approximating Polytopes

Autor: David M. Mount, Sunil Arya, Guilherme D. da Fonseca

Publikováno v: Discrete and Computational Geometry
Discrete and Computational Geometry, Springer Verlag, 2017, 58 (4), pp.849-870. ⟨10.1007/s00454-016-9856-5⟩
32nd Symposium on Computational Geometry (SoCG 2016)
32nd Symposium on Computational Geometry (SoCG 2016), Jun 2016, Boston, United States
Discrete and Computational Geometry, 2017, 58 (4), pp.849-870. ⟨10.1007/s00454-016-9856-5⟩

Approximating convex bodies succinctly by convex polytopes is a fundamental problem in discrete geometry. A convex body $K$ of diameter $\mathrm{diam}(K)$ is given in Euclidean $d$-dimensional space, where $d$ is a constant. Given an error parameter

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::2e9a8b7499df4a03690b0cac9433615f
https://hal.archives-ouvertes.fr/hal-01893753/document

Distance Oracle on Terrain Surface

Autor: Cheng Long, Victor Junqiu Wei, David M. Mount, Raymond Chi-Wing Wong

Publikováno v: Wei, V J, Wong, R C-W, Long, C & Mount, D M 2017, Distance Oracle on Terrain Surface . in Proceedings of the 2017 ACM International Conference on Management of Data (SIGMOD) . Association for Computing Machinery, Chicago, USA, pp. 1211-1226 . https://doi.org/10.1145/3035918.3064038
SIGMOD Conference

Due to the advance of the geo-spatial positioning and the computer graphics technology, digital terrain data become more and more popular nowadays. Query processing on terrain data has attracted considerable attention from both the academic community

Externí odkaz: https://explore.openaire.eu/search/publication?articleId=doi_dedup___::0b617bcf9d66c026a048cd837c3b92bc
https://pure.qub.ac.uk/en/publications/f1fdeb37-ba8a-4303-8f56-1bc99a05e64b