Mediaspace scheduled maintenance: Aug 25, 2026 07:00 - 12:00 AM. During this time, videos will be temporarily unavailable. Check status updates.

Concept

Quadrilatère

Publications associées (7)

A Note on Lenses in Arrangements of Pairwise Intersecting Circles in the Plane

Rom Pinchasi

Let F be a family of n pairwise intersecting circles in the plane. We show that the number of lenses, that is convex digons, in the arrangement induced by F is at most 2n - 2. This bound is tight. Furthermore, if no two circles in F touch, then the geometr ...

Electronic Journal Of Combinatorics2024

Twisted Bilayer Graphene Quantum Dots for Chiral Nanophotonics

Nikita Tepliakov

Twisted bilayer graphene (TBG) is a two-dimensional chiral material whose optical activity is remarkably strong for its atomic thickness. While the chiral optical properties of TBG are currently well understood, the optical activity of quantum dots (QDs) m ...

2020

Vase-Kite Equilibrium of Resorcin[4]arene Cavitands Investigated Using Molecular Dynamics Simulations with Ball-and-Stick Local Elevation Umbrella Sampling

Jovana Milic

A key feature of resorcin[4]arene cavitands is their ability to switch between a closed/contracted (Vase) and an open/expanded (Kite) conformation. The mechanism and dynamics of this interconversion remains, however, elusive. In the present study, the Vase ...

2019

Bisector Energy and Few Distinct Distances

Frank de Zeeuw

We define the bisector energy E(P) of a set P in R-2 to be the number of quadruples (a, b, c, d) is an element of P-4 such that a, b determine the same perpendicular bisector as c, d. Equivalently, E(P) is the number of isosceles trapezoids determined by P ...

Springer2016

Upper bounds for the perimeter of plane convex bodies

Filip Moric

We show that the maximum total perimeter of k plane convex bodies with disjoint interiors lying inside a given convex body C is equal to , in the case when C is a square or an arbitrary triangle. A weaker bound is obtained for general plane convex bodies. ...

Springer2014

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. ...

Elsevier2013

Tangible Paper Interfaces: Interpreting Pupils' Manipulations

Pierre Dillenbourg, Frédéric Kaplan, Patrick Jermann, Quentin Bonnard

Paper interfaces merge the advantages of the digital and physical world. They can be created using normal paper augmented by a camera+projector system. They are particularly promising for applications in education, because paper is already fully integrated ...

2012