On Computing the Centroid of the Vertices of an Arrangement and Related Problems

DOI10.1007/978-3-540-73951-7_45zbMath1209.68576OpenAlexW1530822924MaRDI QIDQ3603554

Saurabh Ray, Hans Raj Tiwary, Deepak Ajwani, Raimund Seidel

Publication date: 17 February 2009

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-73951-7_45

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 ⋮ Unnamed Item ⋮ Computing the Distance between Piecewise-Linear Bivariate Functions ⋮ Computing Shapley values in the plane

This page was built for publication: On Computing the Centroid of the Vertices of an Arrangement and Related Problems