Concept

Regular polytope

Related publications (75)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.

Indecomposable Coverings with Concave Polygons

We show that for any concave polygon that has no parallel sides and for any k, there is a k-fold covering of some point set by the translates of this polygon that cannot be decomposed into two coverings. Moreover, we give a complete classification of open ...

Springer-Verlag2010

Tangencies between families of disjoint regions in the plane

János Pach

Let C be a family of n convex bodies in the plane, which can be decomposed into k subfamilies of pairwise disjoint sets. It is shown that the number of tangencies between the members of C is at most O(kn), and that this bound cannot be improved. If we only ...

2010

Design Aspects of Carry Lookahead Adders with Vertically-Stacked Nanowire Transistors

Giovanni De Micheli, Davide Sacchetto, Yusuf Leblebici, Mohamed Haykel Ben Jamaa

This paper discusses the newly introduced vertically-stacked silicon nanowire gate-all-around fieldeffect-transistor technology and its advantages for higher density layout design. The vertical nanowire stacking technology allows very-high density arrangem ...

IEEE Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, NJ 08855-1331 USA2010

Automatic grouping of regular structures

Michael Herzog, Frank Scharnowski

To cope with the continuously incoming stream of input, the visual system has to group information across space and time. Usually, spatial and temporal grouping are investigated separately. However, recent findings revealed that these two grouping mechanis ...

Association for Research in Vision and Ophthalmology2010

The Holt-Klee condition for oriented matroids

Holt and Klee have recently shown that every (generic) LP orientation of the graph of a d-polytope satisfies a directed version of the d-connectivity property, i.e. there are d internally disjoint directed paths from a unique source to a unique sink. We in ...

2009

Discovering structural regularity in 3D geometry

Mark Pauly

We introduce a computational framework for discovering regular or repeated geometric structures in 3D shapes. We describe and classify possible regular structures and present an effective algorithm for detecting such repeated geometric patterns in point- o ...

Association for Computing Machinery2008

Comparing coordination schemes for miniature robotic swarms: A case study in boundary coverage of regular structures

Alcherio Martinoli, Nicolaus Correll, Samuel Rutishauser

We consider boundary coverage of a regular structure by a swarm of miniature robots, and compare a suite of three fully distributed coordination algorithms experimentally. All algorithms rely on boundary coverage by reactive control, whereas coordination o ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2008

Cascading gravity: Extending the Dvali-Gabadadze-Porrati model to higher dimension

Michele Redi

We present a generalization of the Dvali-Gabadadze-Porrati scenario to higher codimensions which, unlike previous attempts, is free of ghost instabilities. The 4D propagator is made regular by embedding our visible 3-brane within a 4-brane, each with their ...

2008

On Polyhedral Projection and Parametric Programming

Colin Neil Jones

This paper brings together two fundamental topics: polyhedral projection and parametric linear programming. First, it is shown that, given a parametric linear program (PLP), a polyhedron exists whose projection provides the solution to the PLP. Second, the ...

2008

An algorithm for the recovery of disrupted airline schedules

Michel Bierlaire, Matteo Salani, Niklaus Eggenberg

We consider the recovery of an airline schedule after an unpredicted event, commonly called disruption, that makes the planned schedule unfeasible. In particular we consider the aircraft recovery problem for a heterogeneous fleet of aircrafts, made of regu ...

2008