Results 21 to 30 of about 815,076 (298)
Centerpoint theorems for wedges [PDF]
Discrete Mathematics & Theoretical Computer Science, 2009 General
Jeff Erickson, Ferran Hurtado, Pat Morin
doaj +1 more source
Single-Player and Two-Player Buttons & Scissors Games [PDF]
, 2016 We study the computational complexity of the Buttons \& Scissors game and obtain sharp thresholds with respect to several parameters. Specifically we show that the game is NP-complete for $C = 2$ colors but polytime solvable for $C = 1$.
Burke, Kyle +15 more
core +3 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
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
Computational Geometry Column 34 [PDF]
, 1998 Problems presented at the open-problem session of the 14th Annual ACM Symposium on Computational Geometry are ...
Agarwal, Pankaj K., O'Rourke, Joseph
core +3 more sources
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
Integrated Surrogate Optimization of a Vertical Axis Wind Turbine
Energies, 2021 In this work, a 3D computational model based on computational fluid dynamics (CFD) is built to simulate the aerodynamic behavior of a Savonius-type vertical axis wind turbine with a semi-elliptical profile.
Marco A. Moreno-Armendáriz +3 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
Quantum Computation in Computational Geometry
Interdisciplinary Information Sciences, 2002 Summary: We discuss applications of quantum computation to geometric data processing. These applications include problems on convex hulls, minimum enclosing balls, linear programming, and intersection problems. Technically, we apply the well-known algorithm of \textit{L. K. Grover} [Proc. 28th annual ACM symposium 1996, 212--219 (1996; Zbl 0922.68044)]
Sadakane, Kunihiko +2 more
openaire +1 more source