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

@inproceedings{Ajwani2007OnCT,
  title={On Computing the Centroid of the Vertices of an Arrangement and Related Problems},
  author={Deepak Ajwani and Saurabh Ray and Raimund Seidel and Hans Raj Tiwary},
  booktitle={WADS},
  year={2007}
}
We consider the problem of computing the centroid of all the vertices in a non-degenerate arrangement of n lines. The trivial approach requires the enumeration of all ` 

References

Publications referenced by this paper.
Showing 1-9 of 9 references

Overmars . On a class of ø ( n 2 ) problems in computational geometry

  • Anka Gajentaan, H. Mark
  • Comput . Geom . Theory Appl .
  • 1997

Agarwal and Micha Sharir . Applications of a new spacepartitioning technique

  • K. Pankaj
  • Discrete Comput . Geom .
  • 1993

Similar Papers

Loading similar papers…