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

DOI10.1007/978-3-540-73951-7_45zbMATH Open1209.68576OpenAlexW1530822924MaRDI QIDQ3603554FDOQ3603554

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

Recommendations

• scientific article
• COMPUTING THE CENTER OF AREA OF A CONVEX POLYGON
• Algorithms for computing centroids
• Computing a Face in an Arrangement of Line Segments and Related Problems
• scientific article

Mathematics Subject Classification ID

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

Cited In (10)

• Title not available (Why is that?)
• Computing Shapley values in the plane
• Title not available (Why is that?)
• A study on the centroid vector of a polyhedron
• A center of a polytope: An expository review and a parallel implementation
• Batched Point Location in SINR Diagrams via Algebraic Tools
• Title not available (Why is that?)
• Algorithms for computing centroids
• Title not available (Why is that?)
• Computing the Distance between Piecewise-Linear Bivariate Functions

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3603554)