Half-Space Power Diagrams and Discrete Surface Offsets

We present an efficient, trivially parallelizable algorithm to compute offset surfaces of shapes discretized using a dexel data structure. Our algorithm is based on a two-stage sweeping procedure that is simple to implement and efficient, entirely avoiding volumetric distance field computations typi...

Ausführliche Beschreibung

Bibliographische Detailangaben
Veröffentlicht in:IEEE transactions on visualization and computer graphics. - 1996. - (2019) vom: 11. Okt.
1. Verfasser: Chen, Zhen (VerfasserIn)
Weitere Verfasser: Panozzo, Daniele, Dumas, Jeremie
Format: Online-Aufsatz
Sprache:English
Veröffentlicht: 2019
Zugriff auf das übergeordnete Werk:IEEE transactions on visualization and computer graphics
Schlagworte:Journal Article
LEADER 01000caa a22002652 4500
001 NLM302202935
003 DE-627
005 20240229162349.0
007 cr uuu---uuuuu
008 231225s2019 xx |||||o 00| ||eng c
024 7 |a 10.1109/TVCG.2019.2945961  |2 doi 
028 5 2 |a pubmed24n1308.xml 
035 |a (DE-627)NLM302202935 
035 |a (NLM)31613769 
040 |a DE-627  |b ger  |c DE-627  |e rakwb 
041 |a eng 
100 1 |a Chen, Zhen  |e verfasserin  |4 aut 
245 1 0 |a Half-Space Power Diagrams and Discrete Surface Offsets 
264 1 |c 2019 
336 |a Text  |b txt  |2 rdacontent 
337 |a ƒaComputermedien  |b c  |2 rdamedia 
338 |a ƒa Online-Ressource  |b cr  |2 rdacarrier 
500 |a Date Revised 27.02.2024 
500 |a published: Print-Electronic 
500 |a Citation Status Publisher 
520 |a We present an efficient, trivially parallelizable algorithm to compute offset surfaces of shapes discretized using a dexel data structure. Our algorithm is based on a two-stage sweeping procedure that is simple to implement and efficient, entirely avoiding volumetric distance field computations typical of existing methods. Our construction is based on properties of half-space power diagrams, where each seed is only visible by a half space, which were never used before for the computation of surface offsets. The primary application of our method is interactive modeling for digital fabrication. Our technique enables a user to interactively process high-resolution models. It is also useful in a plethora of other geometry processing tasks requiring fast, approximate offsets, such as topology optimization, collision detection, and skeleton extraction. We present experimental timings, comparisons with previous approaches, and provide a reference implementation in the supplemental material 
650 4 |a Journal Article 
700 1 |a Panozzo, Daniele  |e verfasserin  |4 aut 
700 1 |a Dumas, Jeremie  |e verfasserin  |4 aut 
773 0 8 |i Enthalten in  |t IEEE transactions on visualization and computer graphics  |d 1996  |g (2019) vom: 11. Okt.  |w (DE-627)NLM098269445  |x 1941-0506  |7 nnns 
773 1 8 |g year:2019  |g day:11  |g month:10 
856 4 0 |u http://dx.doi.org/10.1109/TVCG.2019.2945961  |3 Volltext 
912 |a GBV_USEFLAG_A 
912 |a SYSFLAG_A 
912 |a GBV_NLM 
912 |a GBV_ILN_350 
951 |a AR 
952 |j 2019  |b 11  |c 10