Line problems in nonlinear computational geometry

Simple item page
dc.creatorSottile, Frank
dc.creatorTheobald, Thorsten
dc.date2006-10-12
dc.date2007-04-17
dc.date.accessioned2026-07-07T07:56:47Z
dc.date.available2026-07-07T07:56:47Z
dc.descriptionWe first review some topics in the classical computational geometry of lines, in particular the O(n^{3+ε}) bounds for the combinatorial complexity of the set of lines in R^3 interacting with $n$ objects of fixed description complexity. The main part of this survey is recent work on a core algebraic problem--studying the lines tangent to k spheres that also meet 4-k fixed lines. We give an example of four disjoint spheres with 12 common real tangents.
dc.description22 pages, 13 color figures
dc.identifierhttps://arxiv.org/abs/math/0610407
dc.identifierhttp://arxiv.org/abs/math/0610407
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/127438
dc.subjectMetric Geometry
dc.subjectAlgebraic Geometry
dc.subject14N99; 14Q15; 52C45; 68U05
dc.titleLine problems in nonlinear computational geometry
dc.typetext

Files

Collections

arXiv