Concept

Théorème du séparateur planaire

Publications associées (65)

Design and fabrication of a novel centimeter scale three dimensional silicon tip, tilt and piston mirror mechanism

François Barrot, Dara Zaman Bayat, Johannes Richard Cornelis Geerit Kruis, Rémy Fournier

A novel centimetre scale tip tilt piston mirror mechanism has been designed in silicon. The mirror consists of three identical mechanism parts and one mirror part. The fabrication of the parts was done with photolithography and Deep Reactive Ion Etching an ...

2013

Sensor and actuator integrated low-profile robotic Origami

Jamie Paik, Amir Firouzeh, Yi Sun

The robotic origami (Robogami) is a low-profile, sheet-like robot with multi degrees-of-freedom (DoF) that embeds different functional layers. Due to its planar form, it can take advantage of precise 2D fabrication methods usually reserved for micro and na ...

Ieee2013

Design and Optimization of Orthogonally Intersecting Planar Surfaces

Mark Pauly, Yuliy Gennadievich Schwartzburg

We present a method for the design of 3D constructions from planar pieces that can be cut easily and cheaply with laser cutters and similar Computer Numerical Control (CNC) machines. By cutting tight slits in intersecting pieces, they can be slid into each ...

Springer Berlin Heidelberg2012

Efficient graph planarization in sensor networks and local routing algorithm

Florian Huc

In this paper, we propose an efficient planarization algorithm and a routing algorithm dedicated to Unit Disk Graphs whose nodes are localized using the Virtual Raw Anchor Coordinate system (VRAC). Our first algorithm computes a planar 2-spanner under ligh ...

Ieee2012

Approximating the edit distance for genomes with duplicate genes under DCJ, insertion and deletion

Yu Lin, Mingfu Shao

Computing the edit distance between two genomes under certain operations is a basic problem in the study of genome evolution. The double-cut-and-join (DCJ) model has formed the basis for most algorithmic research on rearrangements over the last few years. ...

Biomed Central Ltd2012

Coloring fuzzy circular interval graphs

Friedrich Eisenbrand, Martin Niemeier

Given a graph G with nonnegative node labels w, a multiset of stable sets S_1,...,S_k\subseteq V(G) such that each vertex v \in V(G) is contained in w(v) many of these stable sets is called a weighted coloring. The weighted coloring number \chi_w(G) is the ...

Elsevier2012

Functional Webs for Freeform Architecture

Bailin Deng

Rationalization and construction-aware design dominate the issue of realizability of freeform architecture. The former means the decomposition of an intended shape into parts which are sufficiently simple and efficient to manufacture; the latter refers to ...

Wiley-Blackwell2011

Diameter Bounds for Planar Graphs

Radoslav Fulek, Filip Moric, David Pritchard

The inverse degree of a graph is the sum of the reciprocals of the degrees of its vertices. We prove that in any connected planar graph, the diameter is at most 5/2 times the inverse degree, and that this ratio is tight. To develop a crucial surgery method ...

Elsevier2011

Primal-dual Approximation Algorithms for Node-Weighted Steiner Forest on Planar Graphs

Carsten Moldenhauer

NODE-WEIGHTED STEINER FOREST is the following problem: Given an undirected graph, a set of pairs of terminal vertices, a weight function on the vertices, find a minimum weight set of vertices that includes and connects each pair of terminals. We consider t ...

Academic Press Inc Elsevier Science2011

Orthogeodesic Point-Set Embedding of Trees

Radoslav Fulek, Fabrizio Frati

Let S be a set of N grid points in the plane, no two of which lie on the same horizontal or vertical line, and let G be a graph with n vertices (n

Elsevier Science Bv2011

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