EG2020

Permanent URI for this community

https://diglib.eg.org/handle/10.2312/2632883

Browse

Browsing EG2020 by Subject "Computational geometry"

Now showing 1 - 2 of 2
  • Thumbnail Image
    Item
    Black Box Geometric Computing with Python: From Theory to Practice
    (The Eurographics Association, 2020) Koch, Sebastian; Schneider, Teseo; Li, Chengchen; Panozzo, Daniele; Fjeld, Morten and Frisvad, Jeppe Revall
    The first part of the course is theoretical, and introduces the finite element method trough interactive Jupyter notebooks. It also covers recent advancements toward an integrated pipeline, considering meshing and element design as a single challenge, leading to a black box pipeline that can solve simulations on ten thousand in the wild meshes, without any parameter tuning. In the second part we will move to practice, introducing a set of easy-to-use Python packages for applications in geometric computing. The presentation will have the form of live coding in a Jupyter notebook. We have designed the presented libraries to have a shallow learning curve, while also enabling programmers to easily accomplish a wide variety of complex tasks. Furthermore, these libraries utilize NumPy arrays as a common interface, making them highly composable with each-other as well as existing scientific computing packages. Finally, our libraries are blazing fast, doing most of the heavy computations in C++ with a minimal constant-overhead interface to Python. In the course, we will present a set of real-world examples from geometry processing, physical simulation, and geometric deep learning. Each example is prototypical of a common task in research or industry and is implemented in a few lines of code. By the end of the course, attendees will have exposure to a swiss-army-knife of simple, composable, and high-performance tools for geometric computing.
  • Thumbnail Image
    Item
    Interactive Flat Coloring of Minimalist Neat Sketches
    (The Eurographics Association, 2020) Parakkat, Amal Dev; Madipally, Prudhviraj; Gowtham, Hari Hara; Cani, Marie-Paule; Wilkie, Alexander and Banterle, Francesco
    We introduce a simple Delaunay-triangulation based algorithm for the interactive coloring of neat line-art minimalist sketches, ie. vector sketches that may include open contours. The main objective is to minimize user intervention and make interaction as natural as with the flood-fill algorithm while extending coloring to regions with open contours. In particular, we want to save the user from worrying about parameters such as stroke weight and size. Our solution works in two steps, 1) a segmentation step in which the input sketch is automatically divided into regions based on the underlying Delaunay structure and 2) the interactive grouping of neighboring regions based on user input. More precisely, a region adjacency graph is computed from the segmentation result, and is interactively partitioned based on user input to generate the final colored sketch. Results show that our method is as natural as a bucket fill tool and powerful enough to color minimalist sketches.