Concept

Particular point topology

Publications associées (17)

Design and Simulation of a Wide-Bandwidth CMUTs Array with Dual-Mixed radii and Multi Operating Modes

Yu Bai, Zhengwen Jiang, Yihe Zhao, Jie Li, Zichen Liu

A capacitive micromachined ultrasonic transducers (CMUTs) array with dual-mixed radii is designed to improve bandwidth and realize multi-modes operating for immersed ultrasonic applications. The two-size (TS) CMUT array is composed of two sub-arrays with d ...

IEEE2021

Unique decomposition of homogeneous languages and application to isothetic regions

Nicolas René Jean Ninin

A language is said to be homogeneous when all its words have the same length. Homogeneous languages thus form a monoid under concatenation. It becomes freely commutative under the simultaneous actions of every permutation group G(n) on the collection of ho ...

2019

On the existence of ordinary triangles

Sebastian Urban Stich, Radoslav Fulek, Márton Naszódi

Let P be a finite point set in the plane. A \emph{c-ordinary triangle} in P is a subset of P consisting of three non-collinear points such that each of the three lines determined by the three points contains at most c points of P. Motivated by a question o ...

Elsevier2017

Algebraic and topological methods in combinatorics

Adrian Claudiu Valculescu

The present thesis deals with problems arising from discrete mathematics, whose proofs make use of tools from algebraic geometry and topology. The thesis is based on four papers that I have co-authored, three of which have been published in journals, and o ...

EPFL2017

Separation with restricted families of sets

János Pach, Gábor Tardos, Márton Naszódi, Zsolt Langi

Given a finite n-element set X, a family of subsets F subset of 2(X) is said to separate X if any two elements of X are separated by at least one member of F. It is shown that if vertical bar F vertical bar > 2(n-1), then one can select vertical bar log n ...

Academic Press Inc Elsevier Science2016

Decomposition of Multiple Packings with Subquadratic Union Complexity

János Pach, Bartosz Maria Walczak

Suppose k is a positive integer and X is a k-fold packing of the plane by infinitely many arc-connected compact sets, which means that every point of the plane belongs to at most k sets. Suppose there is a function f(n) = o(n(2)) with the property that any ...

Cambridge Univ Press2016

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

Coloring Intersection Graphs of Arc-Connected Sets in the Plane

Bartosz Maria Walczak, Michal Lason

A family of sets in the plane is simple if the intersection of any subfamily is arc-connected, and it is pierced by a line L if the intersection of any member with L is a nonempty segment. It is proved that the intersection graphs of simple families of com ...

Springer2014

Local Barycentric Coordinates

Sofien Bouaziz, Bailin Deng

Barycentric coordinates yield a powerful and yet simple paradigm to interpolate data values on polyhedral domains. They represent interior points of the domain as an affine combination of a set of control points, defining an interpolation scheme for any fu ...

Association for Computing Machinery2014

Large simplices determined by finite point sets

János Pach, Filip Moric

Given a set P of n points in ℝd, let d1 > d2 >...denote all distinct inter-point distances generated by point pairs in P. It was shown by Schur, Martini, Perles, and Kupitz that there is at most oned-dimensional regular simplex of edge length d1 whos ...

Springer-Verlag2013

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