Found: 6
Select item for more details and to access through your institution.
An (Almost) Optimal Solution for Orthogonal Point Enclosure Query in ℝ3.
- Published in:
- Mathematics of Operations Research, 2020, v. 45, n. 1, p. 369, doi. 10.1287/moor.2019.0994
- By:
- Publication type:
- Article
APPROXIMATE RANGE COUNTING REVISITED.
- Published in:
- Journal of Computational Geometry, 2021, v. 12, n. 1, p. 40
- By:
- Publication type:
- Article
SEARCHING FOR THE CLOSEST-PAIR IN A QUERY TRANSLATE.
- Published in:
- Journal of Computational Geometry, 2020, v. 11, n. 2, p. 26
- By:
- Publication type:
- Article
New Bounds for Range Closest-Pair Problems.
- Published in:
- Discrete & Computational Geometry, 2022, v. 68, n. 1, p. 1, doi. 10.1007/s00454-022-00388-7
- By:
- Publication type:
- Article
A Bottleneck Matching Problem with Edge-Crossing Constraints.
- Published in:
- International Journal of Computational Geometry & Applications, 2015, v. 25, n. 4, p. 245, doi. 10.1142/S0218195915500144
- By:
- Publication type:
- Article
DATA STRUCTURES FOR RANGE-AGGREGATION OVER CATEGORIES.
- Published in:
- International Journal of Foundations of Computer Science, 2011, v. 22, n. 7, p. 1707, doi. 10.1142/S0129054111008982
- By:
- Publication type:
- Article