Univerza na Primorskem Fakulteta za matematiko, naravoslovje in informacijske tehnologije
SI | EN

četrtek, 13. februar 2025 Gianmarco CHERCHI: Interactive and Robust Mesh Booleans

V ponedeljek, 17. februarja 2025, bo ob 16:00 uri izvedeno
predavanje v okviru PONEDELJKOVEGA SEMINARJA RAČUNALNIŠTVA IN INFORMATIKE
Oddelkov za Informacijske znanosti in tehnologije UP FAMNIT in UP IAM.

ČAS/PROSTOR: 17. februar 2025 ob 16.00 v FAMNIT-VP2.

------------------------------------------------
PREDAVATELJ: Gianmarco CHERCHI
------------------------------------------------

Gianmarco Cherchi is a Computer Science Researcher (Tenure Track Assistant Professor) at the Department of Mathematics and Computer Science of the University of Cagliari (Italy), where he obtained his PhD. His research interests are in Computer Graphics and Geometry Processing, focusing on the generation and optimization of surface and volumetric meshes, and Digital Fabrication. He is also the Professor of the "Data Visualization" (Applied Computer Science and Data Analytics BSc) and "Web Programming" (Computer Science BSc) courses at the University of Cagliari. In 2024, he received the "Young Investigator Award 2024," granted by the Shape Modeling International Organization.

------------------------------------------------------------------
NASLOV: Interactive and Robust Mesh Booleans
------------------------------------------------------------------

POVZETEK:

Boolean operations are among the most used paradigms to create and edit digital shapes. Despite being conceptually simple, the computation of mesh Booleans is notoriously challenging. The main issues come from numerical approximations that make the detection and processing of intersection points inconsistent and unreliable, exposing implementations based on floating-point arithmetic to many kinds of failure. Numerical methods based on rational numbers or exact geometric predicates have the needed robustness guarantees that are achieved at the cost of increased computation times that, as of today, have always restricted the use of robust mesh Booleans to offline applications. In this seminar, I will briefly summarize the results obtained in three recent articles on the topic, which have enabled us to develop an algorithm for Boolean operations with robustness guarantees, capable of operating at interactive frame rates on meshes with up to 200K triangles.

Seminar bo potekal v živo, s pričetkom ob 16:00 uri v učilnici FAMNIT-VP2.

Vabljeni.