Results 11 to 20 of about 155,395 (263)
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
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
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
Variations of one computational geometry problem
Lietuvos Matematikos Rinkinys, 2004 It is not an easy task to create a challenging problem for the Olympiads in Informatics. The problem should satisfy many requirements. The paper tries to reveal possible stages of development which lead from the original idea to the final formulation of
Jūratė Skūpienė
doaj +3 more sources
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
Multi-Robot Path Planning Based on Multi-Objective Particle Swarm Optimization
IEEE Access, 2019 In this paper, a new method is proposed for the path planning of multi-robots in unknown environments. The method is inspired by multi-objective particle swarm optimization (MOPSO) and is named multi-robot MOPSO.
Sahib Thabit, Ali Mohades
doaj +1 more source
Elementary school students computational thinking skills in learning-based 3D-Geometry problem
IndoMath, 2023 This study aims to investigate how elementary school students' computational thinking skills in learning 3D Geometry. The research method used was quasi-experimental with a pure post-test design of the 31 elementary school students selected using a ...
Suprih Widodo +3 more
doaj +1 more source