Results 1 to 10 of about 41,273 (259)

MFO-RIMS Tandem Workshop: Optimization, Theoretical Computer Science and Algebraic Geometry: Convexity and Beyond

Oberwolfach Reports
Workshop ...
Yoshio Okamoto, Cordian Riener, Markus Schweighofer, Yoshiyuki Sekiguchi   +3 more
core   +5 more sources

Hypercompositional Algebra, Computer Science and Geometry [PDF]

Mathematics, 2020
The various branches of Mathematics are not separated between themselves. On the contrary, they interact and extend into each other’s sometimes seemingly different and unrelated areas and help them advance. In this sense, the Hypercompositional Algebra’s path has crossed, among others, with the paths of the theory of Formal Languages, Automata and ...
Gerasimos Massouros, Christos Massouros
openaire   +3 more sources

A Comparative Study of k-Nearest Neighbour Techniques in Crowd Simulation [PDF]

, 2017
The k-nearest neighbour (kNN) problem appears in many different fields of computer science, such as computer animation and robotics. In crowd simulation, kNN queries are typically used by a collision-avoidance method to prevent unnecessary computations ...
Hillebrand, A., Sub Computational Geometry, Computer Graphics, Geraerts, R.J., Sub Computer Graphics, Vermeulen, Jordi   +5 more
core   +1 more source

Logic, Algebra, and Geometry at the Foundation of Computer Science [PDF]

, 2019
This paper shows by examples how the Theory of Programming can be taught to first-year CS undergraduates. The only prerequisite is their High School acquaintance with algebra, geometry, and propositional calculus. The main purpose of teaching the subject is to support practical programming assignments and projects throughout the degree course. The aims
Tony Hoare, Alexandra Mendes, João F. Ferreira 0001   +2 more
openaire   +1 more source

The combination of spatial access methods and computational geometry in geographic database systems [PDF]

, 1991
Geographic database systems, known as geographic information systems (GISs) particularly among non-computer scientists, are one of the most important applications of the very active research area named spatial database systems. Consequently following the
Kriegel, Hans-Peter, Thomas Brinkhoff, Ralf Schneider, Hans-peter Kriegel, Schneider, Ralf, Brinkhoff, Thomas   +5 more
core   +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. Similarly the game is
Jody Leonard, Harrison Gregg, Kyle Burke, Burke, Kyle,, Hesterberg, Adam, Maarten Löffler, Gregg, Harrison,, Michael Hoffmann, Hearn, Robert A.,, Adam Hesterberg, Kostitsyna, Irina, Loeffler, Maarten,, Demaine, Erik, Hoffmann, Michael,, Robert A. Hearn, Ryuhei Uehara, Santiago, Aaron,, Computational Geometry, Hoffman, Michael, Schmidt, Christiane, Erik D. Demaine, Hesterberg, Adam Classen, Gregg, Harrison, Demaine, Erik D, Aaron Santiago, Ito, Hiro,, Williams, Aaron,, Sub Computational Geometry, Löffler, Maarten, Hearn, Robert R.A., Leonard, Jody,, Ito, Hiro, Hoffmann, Michael, Hearn, Robert, Irina Kostitsyna, Uno, Yushi,, Uehara, Ryuhei,, Uno, Yushi, Santiago, Aaron, Burke, Kyle, Leonard, Jody, Yushi Uno, Hesterberg, Adam,, Demaine, Erik D.,, Kostitsyna, Irina,, Aaron Williams, Hearn, Robert A., Demaine, Erik D., Christiane Schmidt, Hiro Ito, Williams, Aaron, Schmidt, Christiane,, Uehara, Ryuhei   +52 more
core   +1 more source

Geometry, analysis, and computation in mathematics and applied sciences. Final report [PDF]

, 1995
Since 1993, the GANG laboratory has been co-directed by David Hoffman, Rob Kusner and Peter Norman. A great deal of mathematical research has been carried out here by them and by GANG faculty members Franz Pedit and Nate Whitaker. Also new communication tools, such as the GANG Webserver have been developed. GANG has trained and supported nearly a dozen
Kusner, R. B., Hoffman, D. A., Norman, P., Pedit, F., Whitaker, N., Oliver, D.   +5 more
openaire   +2 more sources

Dynamic stabbing queries with sub-logarithmic local updates for overlapping intervals: Proc. 12th International Computer Science Symposium in Russia

, 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, Löffler, Maarten, Khramtcova, Elena, Computational Geometry   +3 more
core   +1 more source

Lombardi Drawings of Knots and Links [PDF]

, 2017
Knot and link diagrams are projections of one or more 3-dimensional simple closed curves into lR2, such that no more than two points project to the same point in lR2. These diagrams are drawings of 4-regular plane multigraphs.
Vogtenhuber, Birgit, Sub Computational Geometry, Löffler, Maarten, Kindermann, Philipp, Schulz, André, Maarten Löffler, Philipp Kindermann, Computational Geometry, Kobourov, Stephen, Martin Nöllenburg, Nöllenburg, Martin, Thurston, Dylan, André Schulz, Stephen Kobourov, Birgit Vogtenhuber, Kobourov, Stephen G.   +15 more
core   +1 more source

Computational Algebraic Geometry as a Computational Science Elective

The Journal of Computational Science Education, 2010
This paper presents a new mathematics elective for an undergraduate Computational Science program. Algebraic Geometry is a theoretical area of mathematics with a long history, often highlighted by extreme abstraction and difficulty. This changed in the 1960’s when Bruno Buchberger created an algorithm that allowed Algebraic Geometers to compute ...
openaire   +2 more sources