20.500.12556/RUL-167822 Finding a largest-area triangle in a terrain in near-linear time A terrain is an $x$-monotone polygon whose lower boundary is a single line segment. We present an algorithm to find in a terrain a triangle of largest area in $O(n\log n)$ time, where $n$ is the number of vertices defining the terrain. The best previous algorithm for this problem has a running time of $O(n^2)$. terrain inclusion problem geometric optimisation hereditary segment tree true false true Angleški jezik Ni določen Članek v reviji 2025-03-13 12:44:04 2025-03-13 12:44:07 2025-03-14 03:56:02 0000-00-00 00:00:00 2025 0 0 13 str. art. 102171 Vol. 128 Sep. 2025 0000-00-00 Zaloznikova Objavljeno NiDoloceno 0000-00-00 0000-00-00 0000-00-00 004.92:519.8 0925-7721 10.1016/j.comgeo.2025.102171 228678147 1-s2.0-S0925772125000094-main.pdf 1-s2.0-S0925772125000094-main.pdf 1 00A057499D5A754F75E94E24061041A8 fc45a5795cc21596dd4c2cbfae2412117fd55a8658a0542b939546bd1ba0108d be63400e-ffff-11ef-b232-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=200626 https://www.sciencedirect.com/science/article/pii/S0925772125000094 1 7d50e01f-ffff-11ef-b232-0050569b8976 https://repozitorij.uni-lj.si/Dokument.php?lang=slv&id=200625 Fakulteta za matematiko in fiziko 0 0 0