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

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

doi:10.1007/978-3-540-73951-7_45

Item

ITEM ACTIONSEXPORT

Add to Basket

Local TagsRelease HistoryDetailsSummary

Released

Conference Paper

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

MPS-Authors

/persons/resource/persons43983

Ajwani, Deepak
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45269

Ray, Saurabh
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

/persons/resource/persons45623

Tiwary, Hans Raj
Algorithms and Complexity, MPI for Informatics, Max Planck Society;

External Resource

No external resources are shared

Fulltext (restricted access)

There are currently no full texts shared for your IP range.

Fulltext (public)

There are no public fulltexts stored in PuRe

Supplementary Material (public)

There is no public supplementary material available

Citation

Ajwani, D., Ray, S., Seidel, R., & Tiwary, H. R. (2007). On Computing the Centroid of the Vertices of an Arrangement and Related Problems. In F. Dehne, J.-R. Sack, & N. Zeh (Eds.), Algorithms and Data Structures (pp. 519-528). Berlin, Germany: Springer. doi:10.1007/978-3-540-73951-7_45.

Cite as: https://hdl.handle.net/11858/00-001M-0000-000F-200F-1

Abstract

There is no abstract available