Computing the Distance between Piecewise-Linear Bivariate Functions

DOI10.1145/2847257zbMath1398.68621arXiv1107.2312OpenAlexW3162131094MaRDI QIDQ4962199

Guillaume Moroz, Boris Aronov

Publication date: 30 October 2018

Published in: ACM Transactions on Algorithms (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1107.2312

zbMATH Keywords

polyhedral terrainpiecewise-linear functionmultipoint evaluation

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (4)

Batched Point Location in SINR Diagrams via Algebraic Tools ⋮ Geometric matching algorithms for two realistic terrains ⋮ Unnamed Item ⋮ Computing Shapley values in the plane

Cites Work

• Unnamed Item
• Unnamed Item
• An incidence theorem in higher dimensions
• On the Erdős distinct distances problem in the plane
• On lines and joints
• Simple proofs of classical theorems in discrete geometry via the Guth-Katz polynomial partitioning technique
• Algorithms for bichromatic line-segment problems and polyhedral terrains
• Algebraic methods in discrete analogs of the Kakeya problem
• On lines, joints, and incidences in three dimensions
• The Joints Problem in $\mathbb{R}^n$
• Fast Polynomial Factorization and Modular Composition
• On Computing the Centroid of the Vertices of an Arrangement and Related Problems
• Computing similarity between piecewise-linear functions
• Incidences in three dimensions and distinct distances in the plane
• Algorithms – ESA 2004

This page was built for publication: Computing the Distance between Piecewise-Linear Bivariate Functions