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

DOI10.1007/978-3-540-73951-7_45MaRDI QIDQ3603554zbMATH OpenOpenAlexFDO

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

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)

Recommendations

• scientific article; zbMATH DE number 140467
• 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; zbMATH DE number 4213496

Cited in

(10)

• Algorithms for computing centroids
• A center of a polytope: An expository review and a parallel implementation
• The maximum-level vertex in an arrangement of lines
• Computing Shapley values in the plane
• A study on the centroid vector of a polyhedron
• scientific article; zbMATH DE number 5552462 (Why is no real title available?)
• scientific article; zbMATH DE number 6801906 (Why is no real title available?)
• scientific article; zbMATH DE number 2119682 (Why is no real title available?)
• scientific article; zbMATH DE number 7559220 (Why is no real title available?)
• A subquadratic algorithm for computing the L₁-distance between two terrains

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)