BEGIN:VCALENDAR
VERSION:2.0
PRODID:Linklings LLC
BEGIN:VTIMEZONE
TZID:Asia/Seoul
X-LIC-LOCATION:Asia/Seoul
BEGIN:STANDARD
TZOFFSETFROM:+0900
TZOFFSETTO:+0900
TZNAME:KST
DTSTART:18871231T000000
DTSTART:19881009T020000
END:STANDARD
END:VTIMEZONE
BEGIN:VEVENT
DTSTAMP:20230103T035312Z
LOCATION:Room 325-AB\, Level 3\, West Wing
DTSTART;TZID=Asia/Seoul:20221208T170000
DTEND;TZID=Asia/Seoul:20221208T183000
UID:siggraphasia_SIGGRAPH Asia 2022_sess171_papers_497@linklings.com
SUMMARY:Declarative Specification for Unstructured Mesh Editing Algorithms
DESCRIPTION:Technical Communications, Technical Papers\n\nDeclarative Spec
 ification for Unstructured Mesh Editing Algorithms\n\nJiang, Dai, Hu, Zhou
 , Dumas...\n\nWe introduce a novel approach to describe mesh generation, m
 esh adaptation, and geometric modeling algorithms relying on changing mesh
  connectivity using a high-level abstraction. The main motivation is to en
 able easy customization and development of these algorithms via a declarat
 ive specification consisting of a set of per-element invariants, operation
  scheduling, and attribute transfer for each editing operation.\n\nWe demo
 nstrate that widely used algorithms editing surfaces and volumes can be co
 mpactly expressed with our abstraction, and their implementation within ou
 r framework is simple, automatically parallelizable on shared-memory archi
 tectures, and with guaranteed satisfaction of the prescribed invariants. T
 hese algorithms are readable and easy to customize for specific use cases.
 \n\nWe introduce a software library implementing this abstraction and prov
 iding automatically shared memory parallelization.\n\nRegistration Categor
 y: FULL ACCESS, ON-DEMAND ACCESS\n\nLanguage: ENGLISH\n\nFormat: IN-PERSON
 , ON-DEMAND
URL:https://sa2022.siggraph.org/en/full-program/?id=papers_497&sess=sess17
 1
END:VEVENT
END:VCALENDAR