A Geometric Approach for Computing the Kernel of a Polyhedron

Simple item page
dc.contributor.authorSorgente, Tommasoen_US
dc.contributor.authorBiasotti, Silviaen_US
dc.contributor.authorSpagnuolo, Michelaen_US
dc.contributor.editorFrosini, Patrizio and Giorgi, Daniela and Melzi, Simone and Rodolà, Emanueleen_US
dc.date.accessioned2021-10-25T11:53:36Z
dc.date.available2021-10-25T11:53:36Z
dc.date.issued2021
dc.description.abstractWe present a geometric algorithm to compute the geometric kernel of a generic polyhedron. The geometric kernel (or simply kernel) is defined as the set of points from which the whole polyhedron is visible. Whilst the computation of the kernel for a polygon has already been largely addressed in the literature, less has been done for polyhedra. Currently, the principal implementation of the kernel estimation is based on the solution of a linear programming problem. We compare against it on several examples, showing that our method is more efficient in analysing the elements of a generic tessellation. Details on the technical implementation and discussions on pros and cons of the method are also provided.en_US
dc.description.sectionheadersGeometry
dc.description.seriesinformationSmart Tools and Apps for Graphics - Eurographics Italian Chapter Conference
dc.identifier.doi10.2312/stag.20211470
dc.identifier.isbn978-3-03868-165-6
dc.identifier.issn2617-4855
dc.identifier.pages11-19
dc.identifier.urihttps://doi.org/10.2312/stag.20211470
dc.identifier.urihttps://diglib.eg.org:443/handle/10.2312/stag20211470
dc.publisherThe Eurographics Associationen_US
dc.subjectComputing methodologies
dc.subjectVolumetric models
dc.titleA Geometric Approach for Computing the Kernel of a Polyhedronen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
011-019.pdf
Size:
8.82 MB
Format:
Adobe Portable Document Format
Description:
Download
Collections
Italian Chapter Conference 2021 - Smart Tools and Apps in Graphics