Results 11 to 20 of about 206,500 (313)
, 2023 The alpha complex is a subset of the Delaunay triangulation and is often used in computational geometry and topology. One of the main drawbacks of using the alpha complex is that it is non-monotone, in the sense that if (Formula Presented) it is not ...
Reani, Yohai +3 more
core +1 more source
Centerpoint theorems for wedges [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 General
Jeff Erickson, Ferran Hurtado, Pat Morin
doaj +1 more source
Quantum Computation as Geometry [PDF]
Science, 2006 Quantum computers hold great promise for solving interesting computational problems, but it remains a challenge to find efficient quantum circuits that can perform these complicated tasks. Here we show that finding optimal quantum circuits is essentially equivalent to finding the shortest path between two points in a certain curved geometry.
Nielsen, Michael A. +3 more
openaire +6 more sources
Storage in Computational Geometry
CoRR, 2023 This is an interesting result, especially when read together with paper [3]
Yijie Han, Sanjeev Saxena
openaire +2 more sources
, 2017 An important task in trajectory analysis is clustering. The results of a clustering are often summarized by a single representative trajectory and an associated size of each cluster. We study the problem of computing a suitable representative of a set of
Staals, F. +7 more
core +1 more source
Computing Euclidean Steiner trees over segments
EURO Journal on Computational Optimization, 2020 In the classical Euclidean Steiner minimum tree (SMT) problem, we are given a set of points in the Euclidean plane and we are supposed to find the minimum length tree that connects all these points, allowing the addition of arbitrary additional points ...
Ernst Althaus +2 more
doaj +1 more source
Processing the overlay of geometry segments in solving hydrophysics problems by the finite difference method [PDF]
E3S Web of Conferences, 2022 The article deals with issues related to increasing the efficiency of working with data on the geometry of the computational domain when solving hydrophysics problems using the finite difference method.
Litvinov Vladimir +2 more
doaj +1 more source
Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals: Proc. 12th International Computer Science Symposium in Russia [PDF]
, 2017 We present a data structure to maintain a set of intervals on the real line subject to fast insertions and deletions of the intervals, stabbing queries, and local updates.
Sub Computational Geometry +3 more
core +1 more source
Visualizing a Cubic Linkage through the Use of CAS and DGS
Mathematics, 2022 Our goal is to discuss the different issues that arise when attempting to visualize a joints-and-bars cube through GeoGebra, a widespread program that combines dynamic geometry (DGS) and computer algebra systems (CAS). As is standard in the DGS framework,
Tomás Recio +3 more
doaj +1 more source
Non-crossing paths with geographic constraints [PDF]
Discrete Mathematics & Theoretical Computer Science, 2019 A geographic network is a graph whose vertices are restricted to lie in a prescribed region in the plane. In this paper we begin to study the following fundamental problem for geographic networks: can a given geographic network be drawn without crossings?
Rodrigo I. Silveira +2 more
doaj +1 more source