BEGIN:VCALENDAR
PRODID:-//Microsoft Corporation//Outlook MIMEDIR//EN
VERSION:2.0
BEGIN:VEVENT
DTSTART:20151117T231500Z
DTEND:20151118T010000Z
LOCATION:Level 4 - Lobby
DESCRIPTION;ENCODING=QUOTED-PRINTABLE:ABSTRACT: We present a partitioning algorithm to decompose complex 2D data into small simple subregions for effective parallel quad meshing. We formulate the partitioning problem for effective parallel quad meshing, which leads to an expensive quadratic integer optimization problem with linear constraints. Directly solving this problem is prohibitive for large-scale data partitioning. Hence, we suggest a more efficient two-step algorithm to obtain an approximate solution. First, we partition the region into a set of square-like cells using L_infity Centroidal Voronoi Tessellation (CVT), then we solve a graph partitioning on the dual graph of this CVT to minimize the total boundary length of the partitioning, while enforcing the load balancing and each subregion’s connectivity. With this geometry-aware decomposition, subregions are distributed to multiple processors for parallel quadrilateral mesh generation.
SUMMARY:Geometric-Aware Partitioning on Large-Scale Data for Parallel Quad Meshing
PRIORITY:3
END:VEVENT
END:VCALENDAR