Results 31 to 40 of about 814,982 (250)
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 +2 more
doaj +1 more source
Notions of optimal transport theory and how to implement them on a computer [PDF]
, 2017 This article gives an introduction to optimal transport, a mathematical theory that makes it possible to measure distances between functions (or distances between more general objects), to interpolate between objects or to enforce mass/volume ...
Levy, Bruno, Schwindt, Erica
core +4 more sources
Computational Information Geometry in Statistics: Theory and Practice
Entropy, 2014 A broad view of the nature and potential of computational information geometry in statistics is offered. This new area suitably extends the manifold-based approach of classical information geometry to a simplicial setting, in order to obtain an ...
Frank Critchley, Paul Marriott
doaj +1 more source
COMPUTATIONAL GEOMETRY COLUMN 37
International Journal of Computational Geometry & Applications, 1999 Open problems from the 15th Annual ACM Symposium on Computational Geometry.
Demaine, Erik D., O'Rourke, Joseph
openaire +3 more sources
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
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
Optimal Control of a Rigid Body using Geometrically Exact Computations on SE(3) [PDF]
, 2006 Optimal control problems are formulated and efficient computational procedures are proposed for combined orbital and rotational maneuvers of a rigid body in three dimensions. The rigid body is assumed to act under the influence of forces and moments that
Lee, Taeyoung +2 more
core +2 more sources
Dynamic computational geometry
24th Annual Symposium on Foundations of Computer Science (sfcs 1983), 1983 We consider problems in computational geometry when every one of the input points is moving in a prescribed manner. We present and analyze efficient algorithms for a number of problems and prove lower bounds for some of them.
openaire +3 more sources
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
Discrete Mathematics & Theoretical Computer ScienceNot every directed acyclic graph (DAG) whose underlying undirected graph is planar admits an upward planar drawing. We are interested in pushing the notion of upward drawings beyond planarity by considering upward $k$-planar drawings of DAGs in which the
Patrizio Angelini +10 more
doaj +1 more source