|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 8 occurrences of 7 keywords
|
|
|
Results
Found 10 publication records. Showing 10 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
48 | Pankaj K. Agarwal, Micha Sharir |
Pseudo-line arrangements: duality, algorithms, and applications. |
SODA |
2002 |
DBLP BibTeX RDF |
|
36 | Timothy M. Chan |
On Levels in Arrangements of Curves. |
Discret. Comput. Geom. |
2003 |
DBLP DOI BibTeX RDF |
|
28 | Timothy M. Chan |
On Levels in Arrangements of Curves. |
FOCS |
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 |
24 | Timothy M. Chan |
On levels in arrangements of curves, iii: further improvements. |
SCG |
2008 |
DBLP DOI BibTeX RDF |
k-levels, k-sets, arrangements, combinatorial geometry |
20 | Jacob Fox, János Pach, Andrew Suk |
A structure theorem for pseudo-segments and its applications. |
CoRR |
2023 |
DBLP DOI BibTeX RDF |
|
20 | Micha Sharir, Joshua Zahl |
Cutting algebraic curves into pseudo-segments and applications. |
J. Comb. Theory, Ser. A |
2017 |
DBLP DOI BibTeX RDF |
|
20 | Micha Sharir, Joshua Zahl |
Cutting Algebraic Curves into Pseudo-segments and Applications. |
CoRR |
2016 |
DBLP BibTeX RDF |
|
20 | Boris Aronov, Micha Sharir |
Cutting Circles into Pseudo-Segments and Improved Bounds for Incidences% and Complexity of Many Faces. |
Discret. Comput. Geom. |
2002 |
DBLP DOI BibTeX RDF |
|
20 | Sariel Har-Peled, Micha Sharir |
Online point location in planar arrangements and its applications. |
SODA |
2001 |
DBLP BibTeX RDF |
|
15 | Adam Marcus 0001, Gábor Tardos |
Intersection Reverse Sequences and Geometric Applications. |
GD |
2004 |
DBLP DOI BibTeX RDF |
|
Displaying result #1 - #10 of 10 (100 per page; Change: )
|
|