Non-linear subdivision using local spherical coordinates
Related publications (33)
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.
The Supersingular Isogeny Diffie-Hellman (SIDH) protocol has been the main and most efficient isogeny-based encryption protocol, until a series of breakthroughs led to a polynomial-time key-recovery attack. While some countermeasures have been proposed, th ...
These notes cover the lectures of the first named author at 2021 IHES Summer School on "Enumerative Geometry, Physics and Representation Theory" with additional details and references. They cover the definition of Khovanov-Rozansky triply graded homology, ...
A local weighted discontinuous Galerkin gradient discretization method for solving elliptic equations is introduced. The local scheme is based on a coarse grid and successively improves the solution solving a sequence of local elliptic problems in high gra ...
The prediction of the critical buckling conditions of shell structures is plagued by imperfection sensitivity. Non-destructive testing through point-load probing has been recently proposed to map the stability landscape of cylindrical shells. However, the ...
Given n continuous open curves in the plane, we say that a pair is touching if they have finitely many interior points in common and at these points the first curve does not get from one side of the second curve to its other side. Otherwise, if the two cur ...
In this work the differences in R-curve response and traction-separation relations due to a finite damage zone or large-scale bridging (LSB) in mode I fracture on double cantilever beams (DCB) were investigated under end opening forces (EOF) and pure momen ...
A local weighted discontinuous Galerkin gradient discretization method for solving ellipticequations is introduced. The local scheme is based on a coarse grid and successively improvesthe solution solving a sequence of local elliptic problems in high gradi ...
We describe a methodology for the interactive definition of curves and motion paths using a stochastic formulation of optimal control. We demonstrate how the same optimization framework can be used in different ways to generate curves and traces that are g ...
Let S be a set of n points in R-2 contained in an algebraic curve C of degree d. We prove that the number of distinct distances determined by S is at least c(d)n(4/3), unless C contains a line or a circle. We also prove the lower bound c(d)' min{m(2/3)n(2/ ...
Nowadays, one area of research in cryptanalysis is solving the Discrete Logarithm Problem (DLP) in finite groups whose group representation is not yet exploited. For such groups, the best one can do is using a generic method to attack the DLP, the fastest ...