BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Asia/Singapore
X-LIC-LOCATION:Asia/Singapore
BEGIN:STANDARD
TZOFFSETFROM:+0800
TZOFFSETTO:+0800
TZNAME:SGT
DTSTART:19820101T123000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20201212T050125Z
LOCATION:Zoom Room 1
DTSTART;TZID=Asia/Singapore:20201213T121800
DTEND;TZID=Asia/Singapore:20201213T122400
UID:siggraphasia_SIGGRAPH Asia 2020_sess104_papers_259@linklings.com
SUMMARY:Fast and Robust Mesh Arrangements using Floating-point Arithmetic
DESCRIPTION:Technical Papers, Technical Papers Q&A\n\nFast and Robust Mesh
Arrangements using Floating-point Arithmetic\n\nCherchi, Livesu, Scateni,
Attene\n\nWe introduce a novel algorithm to transform any generic set of
triangles in 3D space into a well-formed simplicial complex. Intersecting
elements in the input are correctly identified, subdivided, and connected
to arrange a valid configuration, leading to a topologically sound partiti
on of the space into piece-wise linear cells.\nOur approach does not requi
re the exact coordinates of intersection points to calculate the resulting
complex. \nWe represent any intersection point as an unevaluated combinat
ion of input vertices. We then extend the recently introduced concept of i
ndirect predicates [Attene2020] to define all the necessary geometric test
s that, by construction, are both exact and efficient since they fully exp
loit the floating-point hardware. This design makes our method robust and
guaranteed correct, while being virtually as fast as non-robust floating-p
oint based implementations.\nCompared with existing robust methods, our al
gorithm offers a number of advantages: it is much faster, has a better mem
ory layout, scales well on extremely challenging models, and allows fully
exploiting modern multi-core hardware with a parallel implementation.\nWe
thoroughly tested our method on thousands of meshes, concluding that it co
nsistently outperforms prior art. We also demonstrate its usefulness in va
rious applications, such as computing efficient mesh booleans, Minkowski s
ums, and volume meshes.\n\nRegistration Category: Ultimate Supporter, Ulti
mate Attendee
END:VEVENT
END:VCALENDAR