|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 12 occurrences of 11 keywords
|
|
|
Results
Found 6 publication records. Showing 6 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
65 | Timothy M. Chan |
On Levels in Arrangements of Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 29(3), pp. 375-393, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
|
42 | Timothy M. Chan |
On Levels in Arrangements of Curves. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FOCS ![In: 41st Annual Symposium on Foundations of Computer Science, FOCS 2000, 12-14 November 2000, Redondo Beach, California, USA, pp. 219-227, 2000, IEEE Computer Society, 0-7695-0850-2. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
planar arrangement, subquadratic upper bound, pseudo-parabolas, pseudo-segments, kinetic minimum spanning trees, computational complexity, computational geometry, polynomials, combinatorial geometry, worst-case complexity, polynomial functions |
41 | Hisao Tamaki, Takeshi Tokuyama |
How to Cut Pseudo-Parabolas into Segments. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the Eleventh Annual Symposium on Computational Geometry, Vancouver, B.C., Canada, June 5-12, 1995, pp. 230-237, 1995, ACM, 0-89791-724-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
|
30 | Timothy M. Chan |
On levels in arrangements of curves, iii: further improvements. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 85-93, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
k-levels, k-sets, arrangements, combinatorial geometry |
30 | Sariel Har-Peled, Micha Sharir |
Online point location in planar arrangements and its applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SODA ![In: Proceedings of the Twelfth Annual Symposium on Discrete Algorithms, January 7-9, 2001, Washington, DC, USA., pp. 57-66, 2001, ACM/SIAM, 0-89871-490-7. The full citation details ...](Pics/full.jpeg) |
2001 |
DBLP BibTeX RDF |
|
24 | Sarit Buzaglo, Ron Holzman, Rom Pinchasi |
On s-intersecting curves and related problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
SCG ![In: Proceedings of the 24th ACM Symposium on Computational Geometry, College Park, MD, USA, June 9-11, 2008, pp. 79-84, 2008, ACM, 978-1-60558-071-5. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
$k$-sets, points, curves, vc-dimension, plane |
Displaying result #1 - #6 of 6 (100 per page; Change: )
|
|