Results 31 to 40 of about 206,500 (313)

Linear-Size Universal Point Sets for One-Bend Drawings [PDF]

, 2015
For every integer $n ge 4$, we construct a planar point set $S_n$ of size $6n-10$ such that every $n$-vertex planar graph $G$ admits a plane embedding in which the vertices are mapped to points in $S_n$, and every edge is either a line segment or a ...
Sub Computational Geometry, Löffler, Maarten, Maarten Löffler, Tóth, Csaba, Computational Geometry, Tóth, Csaba D., Csaba D. Tóth   +6 more
core   +1 more source

On morphs of 1-plane graphs [PDF]

, 2022
Morphing geometric graphs is a classical problem in graph theory and computational geometry with seminal results established by Cairns in 1944 [Amer. Math. Monthly, 51] and by Thomassen in 1983 [J. of Comb. Theor., Series B, 34].
Pfister, Maximilian, Angelini, Patrizio, Bekos, Michael, Montecchiani, Fabrizio, Maximilian Pfister, Michael Bekos, Patrizio Angelini, Fabrizio Montecchiani   +7 more
core   +1 more source

Mixed Map Labeling

Journal of Spatial Information Science, 2016
Point feature map labeling is a geometric visualization problem, in which a set of input points must be labeled with a set of disjoint rectangles (the bounding boxes of the label texts).
Maarten Löffler, Martin Nöllenburg, Frank Staals   +2 more
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, SUGAWARA, Noriko, TOKUYAMA, Takeshi   +2 more
openaire   +1 more source

Multi-Colored Spanning Graphs [PDF]

, 2016
We study a problem proposed by Hurtado et al. [10] motivated by sparse set visualization. Given n points in the plane, each labeled with one or more primary colors, a colored spanning graph (CSG) is a graph such that for each primary color, the vertices ...
Sub Computational Geometry, Akitaya, Hugo A., Löffler, Maarten, Akatya, Hugo, Hugo A. Akitaya, Maarten Löffler, Tóth, Csaba, Computational Geometry, Tóth, Csaba D., Csaba D. Tóth   +9 more
core   +1 more source

A Refined Definition for Groups of Moving Entities and its Computation [PDF]

, 2016
One of the important tasks in the analysis of spatio-temporal data collected from moving entities is to find a group: a set of entities that travel together for a sufficiently long period of time. Buchin et al.
Sub Computational Geometry, Löffler, Maarten, Wiratma, Lionov, Computational Geometry, Kreveld, Marc van, Hong, Seok-Hee, van Kreveld, Marc, Staals, Frank   +7 more
core   +1 more source

Investigating computational geometry for failure prognostics

International Journal of Prognostics and Health Management, 2014
Prognostics and Health Management (PHM) is a multidisciplinary field aiming at maintaining physical systems in their optimal functioning conditions.
Emmanuel Ramasso
doaj   +1 more source

Computational geometry and discrete computations [PDF]

, 1996
In this paper we describe some problems arising in practical implementation of algorithms from computational geometry. Going to robust algorithms needs to solve issues such as rounding errors and degeneracies. Most of the problems are closely related to the incompatibility between on one side algorithms designed for continuous data and on the other ...
openaire   +3 more sources

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

Guest Editors' Foreword

Journal of Computational Geometry, 2015
The Annual Symposium on Computational Geometry has a special issue in the Journal of Computational Geometry for the first time.
Siu-Wing Cheng, Olivier Devillers
doaj   +1 more source