Ambiuous digitizations by dilation

dc.contributor.authorLincke, C.
dc.contributor.authorWüthrich, C. A.
dc.contributor.editorSkala, Václav
dc.date.accessioned2013-08-20T12:24:15Z
dc.date.available2013-08-20T12:24:15Z
dc.date.issued2002
dc.description.abstractThis article deals with ambiguous surface digitizations by dilation in n-dimensional space. The digitization of a sufficiently regular surface is separating but not necessarily minimal. We will determine conditions under which the supercover and the grid intersection digitizations are discrete surfaces. It will also be proven that non-overlapping domains do not solve the problem of simple points in digitizations. No matter howthe digitizationdomain is chosen therewill occur ambiguous cases which have to be treated differently.en
dc.format4 s.cs
dc.format.mimetypeapplication/pdf
dc.identifier.citationWSCG '2002: Posters: The 10-th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2002, 4.-8. February 2002 Plzeň, p. 29-32.en
dc.identifier.isbn80-903100-0-1
dc.identifier.urihttp://wscg.zcu.cz/wscg2002/Papers_2002/F17.pdf
dc.identifier.urihttp://hdl.handle.net/11025/6074
dc.language.isoenen
dc.publisherUNION Agencyen
dc.relation.ispartofseriesWSCG '2002: Postersen
dc.rights© UNION Agencycs
dc.rights.accessopenAccessen
dc.subjectn-dimenzionální rastrová grafikacs
dc.subjectdigitalizacecs
dc.subjectdiskrétní povrchycs
dc.subject.translatedn-dimensional raster graphicsen
dc.subject.translateddigitizationen
dc.subject.translateddiscrete surfacesen
dc.titleAmbiuous digitizations by dilationen
dc.typekonferenční příspěvekcs
dc.typeconferenceObjecten
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen

Files

Original bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
F17.pdf
Size:
64.62 KB
Format:
Adobe Portable Document Format
Description:
Plný text
License bundle
Showing 1 - 1 out of 1 results
No Thumbnail Available
Name:
license.txt
Size:
1.71 KB
Format:
Item-specific license agreed upon to submission
Description: