Our patch construction algorithm is used for surface reconstruction from a point cloud. The algorithm works on a principle of dividing vertices into cells with adaptive size. Each cell is built ...around the chosen vertex from a point cloud. The remaining vertices in a cell represent close surrounding of the chosen vertex. Small part of the surface is defined with the close surrounding and this small part is called a patch. The patch in general is 2.51) part of the surface and it can be flatened onto the XY plane. Because of this we can use plane triangulation for patch reconstruction. With the triangulation we connect all the vertices into triangles. Because of cell overlapping, patches are automaticaly put together into Final surface.
Type of material - treatise, study
Publication and manufacture - Maribor : Faculty of Electrical Engineering and Computer Science, Laboratory for geometric modelling and multimedia algorithms, 2007
It was not necessary to add the material to the shelf.
Bibliographic material was successfully added on shelf.
Adding bibliographical material on shelf was not successful.
Material is already on the shelf.
Permalink
URL:
Impact factor
Access to the JCR database is permitted only to users from Slovenia. Your current IP address is not on the list of IP addresses with access permission, and authentication with the relevant AAI accout is required.
Year
Impact factor
Edition
Category
Classification
JCR
SNIP
JCR
SNIP
JCR
SNIP
JCR
SNIP
Select the library membership card:
DRS,
in which the journal is indexed
Database name
Field
Year
Links to authors' personal bibliographies
Links to information on researchers in the SICRIS system
Subject headings in COBISS General List of Subject Headings
Select pickup location
The material from the parent unit is free. If the material is delivered to the pickup location from another unit, the library may charge you for this service.
Naročanje gradiva za izposojo v čitalnice
Naročanje kopij člankov
Urnik dostave gradiva z oznako DS v signaturi