Concept

Polygone simple

Publications associées (38)

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

Empty Triangles in Complete Topological Graphs

Andres Jacinto Ruiz Vargas

A simple topological graph is a graph drawn in the plane so that its edges are represented by continuous arcs with the property that any two of them meet at most once. Let be a complete simple topological graph on vertices. The three edges induced by any t ...

Springer2015

Real-time landing place assessment in man-made environments

Pascal Fua, Vincent Lepetit, Christos Marios Christoudias, Xiaolu Sun

We propose a novel approach to the real-time landing site detection and assessment in unconstrained man-made environments using passive sensors. Because this task must be performed in a few seconds or less, existing methods are often limited to simple loca ...

Springer Verlag2014

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

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

Small distances in convex polygons

Filip Moric

Let d(1) < d(2) < ... denote the set of all distances between two vertices of a convex n-gon. We show that the number of pairs of vertices at distance d(2) from one another is at most n + O(1). (C) 2013 Elsevier B.V. All rights reserved. ...

Elsevier Science Bv2013

Fabrication-aware Design with Intersecting Planar Pieces

Mark Pauly, Yuliy Gennadievich Schwartzburg

We propose a computational design approach to generate 3D models composed of interlocking planar pieces. We show how intricate 3D forms can be created by sliding the pieces into each other along straight slits, leading to a simple construction that does no ...

Blackwell Publishing2013

Drawing Planar Graphs Of Bounded Degree With Few Slopes

János Pach, Balázs Keszegh, Doemoetoer Palvoelgyi

We settle a problem of Dujmovic, Eppstein, Suderman, and Wood by showing that there exists a function f with the property that every planar graph G with maximum degree d admits a drawing with noncrossing straight-line edges, using at most f(d) different sl ...

Siam Publications2013

Fourier Approximation Of Symmetric Ideal Knots

Henryk Gerlach, Mathias Carlen

Enforcing a specific symmetry group on a curve, knotted or not, is not trivial using standard interpolations such as polygons or splines. For a prescribed symmetry group we present a symmetrization process based on a Fourier description of a knot. The pres ...

2012

A new method for internal-external rotation measurement in a prosthetic knee

Kamiar Aminian, Arash Arami

In this work, a magnetic measurement system was designed and tested to estimate the Internal-External rotation between the Tibial and Femural parts of a knee prosthesis. To obtain this, the sensors were inserted in polyethylene part while a permanent magne ...

2012

Matrix ALPS: Accelerated Low Rank and Sparse Matrix Reconstruction

Volkan Cevher, Anastasios Kyrillidis

We propose Matrix ALPS for recovering a sparse plus low-rank decomposition of a matrix given its corrupted and incomplete linear measurements. Our approach is a first-order projected gradient method over non-convex sets, and it exploits a well-known memory ...

IEEE2012