About: Fairing of Discrete Surfaces with Boundary That Preserves Size and Qualitative Shape     Goto   Sponge   NotDistinct   Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

AttributesValues
rdf:type
Description
  • In this paper, we propose a new algorithm for fairing discrete surfaces resulting from stereo-based 3D reconstruction task. Such results are typically too dense, uneven and noisy, which is inconvenient for further processing. Our approach jointly optimises mesh smoothness and regularity. The definition is given on a discrete surface and the solution is found by discrete diffusion of a scalar function. Experiments on synthetic and real data demonstrate that the proposed approach is robust, stable, preserves qualitative shape and is applicable to even moderate-size real surfaces with boundary (0.8M vertices and 1.7M triangles).
  • In this paper, we propose a new algorithm for fairing discrete surfaces resulting from stereo-based 3D reconstruction task. Such results are typically too dense, uneven and noisy, which is inconvenient for further processing. Our approach jointly optimises mesh smoothness and regularity. The definition is given on a discrete surface and the solution is found by discrete diffusion of a scalar function. Experiments on synthetic and real data demonstrate that the proposed approach is robust, stable, preserves qualitative shape and is applicable to even moderate-size real surfaces with boundary (0.8M vertices and 1.7M triangles). (en)
  • In this paper, we propose a new algorithm for fairing discrete surfaces resulting from stereo-based 3D reconstruction task. Such results are typically too dense, uneven and noisy, which is inconvenient for further processing. Our approach jointly optimises mesh smoothness and regularity. The definition is given on a discrete surface and the solution is found by discrete diffusion of a scalar function. Experiments on synthetic and real data demonstrate that the proposed approach is robust, stable, preserves qualitative shape and is applicable to even moderate-size real surfaces with boundary (0.8M vertices and 1.7M triangles). (cs)
Title
  • Fairing of Discrete Surfaces with Boundary That Preserves Size and Qualitative Shape
  • Fairing of Discrete Surfaces with Boundary That Preserves Size and Qualitative Shape (en)
  • Fairing of Discrete Surfaces with Boundary That Preserves Size and Qualitative Shape (cs)
skos:prefLabel
  • Fairing of Discrete Surfaces with Boundary That Preserves Size and Qualitative Shape
  • Fairing of Discrete Surfaces with Boundary That Preserves Size and Qualitative Shape (en)
  • Fairing of Discrete Surfaces with Boundary That Preserves Size and Qualitative Shape (cs)
skos:notation
  • RIV/68407700:21230/08:03150831!RIV09-MSM-21230___
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • P(1ET101210406), Z(MSM6840770012)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 367594
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/08:03150831
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • computer vision; graphics; surface reconstruction (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [8EC4BAB90BB4]
http://linked.open...v/mistoKonaniAkce
  • Las Vegas
http://linked.open...i/riv/mistoVydani
  • Berlin
http://linked.open...i/riv/nazevZdroje
  • ISVC 2008: Proceedings 4th International Symposium on Visual Computing
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...vavai/riv/projekt
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Šára, Radim
  • Kostlivá, Jana
  • Matýsková, M.
http://linked.open...vavai/riv/typAkce
http://linked.open...ain/vavai/riv/wos
  • 000264057800011
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
issn
  • 0302-9743
number of pages
http://purl.org/ne...btex#hasPublisher
  • Springer-Verlag
https://schema.org/isbn
  • 978-3-540-89638-8
http://localhost/t...ganizacniJednotka
  • 21230
is http://linked.open...avai/riv/vysledek of
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 41 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software