The paper is devoted to a visualization problem of spatially distributed data. Algorithms of geometric search for an arbitrary set of polyhedrons in 3D space; and isogeometric smoothing based on local splines for 2D and 3D cases are suggested.

Original languageEnglish
StatePublished - 1 Dec 2005
Externally publishedYes
Event15th International Conference on Computer Graphics and Vision, GraphiCon 2005 - Novosibirsk, Russian Federation
Duration: 20 Jun 2005 → 24 Jun 2005

Conference

Conference15th International Conference on Computer Graphics and Vision, GraphiCon 2005
Country/TerritoryRussian Federation
CityNovosibirsk
Period20/06/05 → 24/06/05

    Research areas

  • Computational complexity, Geometric search, Isogeometric smoothing, Local spline

    Scopus subject areas

  • Computer Graphics and Computer-Aided Design
  • Computer Vision and Pattern Recognition

ID: 49824822