Referenced Items are not available for this document.
We obtain improved bounds on the complexity of m distinct faces in an arrangement of n circles and in an arrangement of n unit circles. The bounds are worst-case tight for unit circles, and, for general circles, they nearly coincide with the best known bounds for the number of incidences between m points and n circles.
Published in:
Foundations of Computer Science, 2001. Proceedings. 42nd IEEE Symposium on
Date of Conference: 8-11 Oct. 2001
- Page(s):
- 74 - 83
- Print ISBN:
- 0-7695-1116-3
- INSPEC Accession Number:
- 7121382
- Digital Object Identifier :
- 10.1109/SFCS.2001.959882
- Product Type:
- Conference Publications
About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies
A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2013 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.
