We define a regularized shape distortion (quality) measure for curved high-order 2D elements on a Riemannian plane. To this end, we measure the deviation of a given 2D element, straight-sided or curved, from the stretching ...

Este trabajo consiste en la creación de un plug-in para QGIS (un editor de geometrías). Consiste en proveer a usuarios de herramientas de simplificación de geometrías con restricciones especiales. En el trabajo se explica ...

Optimal viewpoint prediction is an essential task in many computer graphics applications. Unfortunately, common viewpointqualities suffer from two major drawbacks: dependency on clean surface meshes, which are not always ...

Automatic computation of best views of objects is very useful. For example, they can be used as the starting point of a scene exploration, or to enrich galleries of objects available through Internet by adding an image a ...

In this note we present an application of a new tool (the Gröbner cover method, to discuss parametric polynomial systems of equations) in the realm of automatic discovery of theorems in elementary geometry. Namely, we ...

Geometric constraint solving is a growing field which plays a paramount role in industrial applications and that is deeply rooted in automated deduction in geometry. In this work we report on an algorithm to solve ...

Unfitted (also known as embedded or immersed) finite element approximations of partial differential equations are very attractive because they have much lower geometrical requirements than standard body-fitted formulations. ...

In geometric constraint solving, 2D well constrained geometric problems can be abstracted as Laman graphs. If the graph is tree decomposable, the constraint-based geometric problem can be solved by a Decomposition-Recombination ...

Most visibility culling algorithms require convexity of occluders. Occluder synthesis algorithms attempt to construct large convex occluders inside bulky non-convex sets. Occluder fusion algorithms generate convex occluders ...