Concept

Triangulation d'un polygone

Publications associées (34)

Quadratic serendipity element shape functions on general planar polygons

This paper proposes a method for the construction of quadratic serendipity element (QSE) shape functions on planar convex and concave polygons. Existing approaches for constructing QSE shape functions are linear combinations of the pair-wise products of ge ...

ELSEVIER SCIENCE SA2022

A Topological characterisation of Weisfeiler-Leman equivalence classes

Graph Neural Networks (GNNs) are learning models aimed at processing graphs and signals on graphs. The most popular and successful GNNs are based on message passing schemes. Such schemes inherently have limited expressive power when it comes to distinguish ...

2022

Multi-View Triangulation: Systematic Comparison and an Improved Method

Peng Song

Triangulation is an important task in the 3D reconstruction of computer vision. It seems simple to find the position of a point in 3D space when its 2D perspective projections in multi-view images are given and the corresponding camera projection matrices ...

2020

Superpixels and Polygons using Simple Non-Iterative Clustering

Sabine Süsstrunk, Radhakrishna Achanta

We present an improved version of the Simple Linear Iterative Clustering (SLIC) superpixel segmentation. Unlike SLIC, our algorithm is non-iterative, enforces connectivity from the start, requires lesser memory, and is faster. Relying on the superpixel bou ...

Ieee2017

Smooth Shapes with Spherical Topology: Beyond Traditional Modeling, Efficient Deformation, and Interaction

Michaël Unser, Pablo Garcia-Amorena Garcia, Daniel Andreas Schmitter

Existing shape models with spherical topology are typically designed either in the discrete domain using interpolating polygon meshes or in the continuous domain using smooth but non-interpolating schemes such as subdivision or NURBS. Both polygon models a ...

2017

Smoothly Deformable Spheres: Modeling, Deformation, and Interaction

Michaël Unser, Pablo Garcia-Amorena Garcia, Daniel Andreas Schmitter

ACM2016

Opaque Sets

János Pach

The problem of finding "small" sets that meet every straight-line which intersects a given convex region was initiated by Mazurkiewicz in 1916. We call such a set an opaque set or a barrier for that region. We consider the problem of computing the shortest ...

Springer2014

Free-Shape Polygonal Object Localization

Pascal Fua, Christos Marios Christoudias, Xiaolu Sun

Polygonal objects are prevalent in man-made scenes. Early approaches to detecting them relied mainly on geometry while subsequent ones also incorporated appearance-based cues. It has recently been shown that this could be done fast by searching for cycles ...

Springer-Verlag Berlin2014

On Polygons Excluding Point Sets

Radoslav Fulek, Balázs Keszegh, Filip Moric

By a polygonization of a finite point set S in the plane we understand a simple polygon having S as the set of its vertices. Let B and R be sets of blue and red points, respectively, in the plane such that is in general position, and the convex hull of B c ...

Springer Japan2013

Simulating Daylight Propagation through Complex Fenestration Systems in a Urban Context Using Variable Sampling Subdivision Scheme

Jean-Louis Scartezzini, Jérôme Henri Kämpf, Chantal Basurto Dávila

The use of Complex Fenestration Systems (CFS) within buildings can contribute to a significant reduction of cooling loads by the way of two assets: the redirection of daylight and the shading of sunrays. In order to back-up these features, daylight perform ...

EPFL Solar Energy and Building Physics Laboratory (LESO-PB)2013

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search