Results 11 to 20 of about 676,044 (284)
Fine-Grained Complexity Theory: Conditional Lower Bounds for Computational Geometry [PDF]
Conference on Computability in Europe, 2021 Fine-grained complexity theory is the area of theoretical computer science that proves conditional lower bounds based on the Strong Exponential Time Hypothesis and similar conjectures.
K. Bringmann
semanticscholar +1 more source
A Computational Approach to a Quasi- Minimal Bezier Surface for Computer Graphics
VFAST Transactions on Software Engineering, 2021 In computer science, the algorithms related to geometry can be exploited in computer aided geometric design, a field in computational geometry. Bézier surfaces are restricted class of surfaces used in computer science, computer graphics and the allied ...
Daud Ahmad +3 more
semanticscholar +1 more source
Universality in long-distance geometry and quantum complexity [PDF]
Nature, 2021 Many different homogeneous metrics on Lie groups, which may have markedly different short-distance properties, are shown to exhibit nearly identical distance functions at long distances, suggesting a large universality class of definitions of quantum ...
Adam R. Brown +3 more
semanticscholar +1 more source
Advanced Engineering Materials, EarlyView., 2023 A novel method for tracking structural changes in gels using widely accessible microcomputed tomography is presented and validated for various hydro‐, alco‐, and aerogels. The core idea of the method is to track positions of micrometer‐sized tracer particles entrapped in the gel and relate them to the density of the gel network.
Anja Hajnal +3 more
wiley +1 more source
The 6th International Conference on Computer Science and Computational Mathematics (ICCSCM 2017)
, 2017 The ICCSCM 2017 (The 6th International Conference on Computer Science and Computational Mathematics) has aimed to provide a platform to discuss computer science and mathematics related issues including Algebraic Geometry, Algebraic Topology ...
semanticscholar +1 more source
Computational geometry as a tool for studying root-finding methods
Filomat, 2019 We present an efficient method from Computational geometry, a branch of computer science devoted to the study of algorithms, for mathematical visualization of a third order root solver.
I. Petkovic, Lidija Rancic
semanticscholar +1 more source
Query processing of spatial objects: Complexity versus Redundancy [PDF]
, 1993 The management of complex spatial objects in applications, such as geography and cartography, imposes stringent new requirements on spatial database systems, in particular on efficient query processing. As shown before, the performance of spatial query
A. Braun +9 more
core +1 more source
Differential Geometry and its Applications, 2022 Many fundamental questions in theoretical computer science are naturally expressed as special cases of the following problem: Let $G$ be a complex reductive group, let $V$ be a $G$-module, and let $v,w$ be elements of $V$. Determine if $w$ is in the $G$-orbit closure of $v$.
openaire +2 more sources
Lagrangian geometry of algebraic varieties [PDF]
arXiv, 2021 Every algebraic variety can be regarded as a symplectic manifold being equipped with a Kahler form. Therefore it is natural to study lagrangian geometry of any algebraic variety. We present two basic constructions which can be applied to a sufficiently wide set of algebraic varieties.
arxiv
Fun with Fonts: Algorithmic Typography [PDF]
, 2014 Over the past decade, we have designed six typefaces based on mathematical theorems and open problems, specifically computational geometry. These typefaces expose the general public in a unique way to intriguing results and hard problems in hinged ...
E.D. Demaine +5 more
core +3 more sources