Concept

Construction à la règle et au compas

Publications associées (32)

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

On The Number Of Ordinary Conics

Frank de Zeeuw, Adrian Claudiu Valculescu

We prove a lower bound on the number of ordinary conics determined by a finite point set in R-2. An ordinary conic for S subset of R-2 is a conic that is determined by five points of S and contains no other points of S. Wiseman and Wilson proved the Sylves ...

Siam Publications2016

Integral Mechanical Attachment for Timber Folded Plate Structures

Christopher Werner Matthias Robeller

Timber folded plate Structures combine the advantages of timber as a construction material, such as its carbon-dioxide storage, low energy production and favorable weight-to-strength ratio, with the structural efficiency and elegance of folded surface stru ...

2015

Integral Mechanical Attachment for Timber Folded Plate Structures

Christopher Werner Matthias Robeller

EPFL2015

High Sum-Rate Three-Write and Nonbinary WOM Codes

Write-once memory (WOM) is a storage medium with memory elements, called cells, which can take on q levels. Each cell is initially in level 0 and can only increase its level. A t-write WOM code is a coding scheme, which allows one to store t messages to th ...

Institute of Electrical and Electronics Engineers2014

Constraint-Based Graphic Statics - A geometrical support for computer-aided structural equilibrium design

Corentin Jean Dominique Fivet

This thesis introduces “constraint-based graphic statics”, a geometrical support for computer-aided structural design. This support increases the freedom with which the designer interacts with the plane static equilibriums being shaped. Constraint-based gr ...

UCLouvain.be2013

The World Health Organization Headquarters in Geneva (1960-1966): how mechanical and electrical services are integral to reading built form

Giulia Marino

The permanent headquarters of the World Health Organizatio, in Geneva, is recognised as one of the major works of Jean Tschumi, who won the international competition in 1960. Shaped by the imposing linear block housing the Secretariat and the Conference Ha ...

Picard2012

Stability and charge transfer at the interface between SiC(0001) and epitaxial graphene

Alfredo Pasquarello, Gabriele Sclauzero

Using density functional calculations, we address the energetics of the interface between the SiC(0001) substrate and the first covalently bonded epitaxial graphene layer. We consider a 6 root 3 x 6 root 3R30 degrees geometry showing the experimental perio ...

Elsevier2011

Curved Folded Plate Timber Structures

Yves Weinand, Hans Ulrich Buri, Ivo Stotz

This work investigates the development of a Curved Origami Prototype made with timber panels. In the last fifteen years the timber industry has developed new, large size, timber panels. Composition and dimensions of these panels and the possibility of mill ...

IABSE-IASS2011

Square Trisection

János Pach, Christian Blanvillain

A square trisection is a problem of assembling three identical squares from a larger square, using a minimal number of pieces. This paper presents an historical overview of the square trisection problem starting with its origins in the third century. We de ...

2010

Decomposition of Geometric Set Systems and Graphs

We study two decomposition problems in combinatorial geometry. The first part of the thesis deals with the decomposition of multiple coverings of the plane. We say that a planar set is cover-decomposable if there is a constant m such that any m-fold coveri ...

EPFL2010