Complexity classes

Applied Filters

Publications

Conferences

Publication Date

5 Results for: Book/Issue: SCG '96: Proceedings of the twelfth annual symposium on Computational geometryEdit SearchSave SearchRSS

Searched The ACM Guide to Computing Literature (3,815,653 records)|Limit your search to The ACM Full-Text Collection (772,220 records)

Showing 1 - 5of5 Results

Select All

Export Citations Save to Binder

per page:

Recency

Article
Free
May 1996
On the sectional area of convex polytopes
SCG '96: Proceedings of the twelfth annual symposium on Computational geometryPages 411–412https://doi.org/10.1145/237218.237411
8
378
Metrics
Total Citations8
Total Downloads378
Last 12 Months48
Last 6 weeks5
View online with eReader
PDF
Article
Free
May 1996
A polynomial-time algorithm for computing a shortest path of bounded curvature amidst moderate obstacles (extended abstract)
- Jean-Daniel Boissonnat,
- Sylvain Lazard
SCG '96: Proceedings of the twelfth annual symposium on Computational geometryPages 242–251https://doi.org/10.1145/237218.237393
25
779
Metrics
Total Citations25
Total Downloads779
Last 12 Months43
Last 6 weeks5
View online with eReader
PDF
Article
Free
May 1996
On the bit complexity of minimum link paths: superquadratic algorithms for problems solvable in linear time
- Simon Kahan,
- Jack Snoeyink
SCG '96: Proceedings of the twelfth annual symposium on Computational geometryPages 151–158https://doi.org/10.1145/237218.237342
5
299
Metrics
Total Citations5
Total Downloads299
Last 12 Months22
Last 6 weeks3
View online with eReader
PDF
Article
Free
May 1996
Rectilinear and polygonal p-piercing and p-center problems
- Micha Sharir,
- Emo Welzl
SCG '96: Proceedings of the twelfth annual symposium on Computational geometryPages 122–132https://doi.org/10.1145/237218.237255
38
635
Metrics
Total Citations38
Total Downloads635
Last 12 Months76
Last 6 weeks22
View online with eReader
PDF
Article
Free
May 1996
A near-linear algorithm for the planar 2-center problem
- Micha Sharir
SCG '96: Proceedings of the twelfth annual symposium on Computational geometryPages 106–112https://doi.org/10.1145/237218.237251
24
397
Metrics
Total Citations24
Total Downloads397
Last 12 Months33
Last 6 weeks4
View online with eReader
PDF