Results 101 to 110 of about 939,183 (156)
A Note on Properties of Discrete Composition Operators [PDF]
arXiv, 2017 We derive properties and a characterization of discrete composition matrices which are useful in the field of numerical computation of shape correspondences.
arxiv
Computational Geometry Column 42 [PDF]
SIGACT News, 32(3) Issue, 120 Sep. 2001, 63--72, 2001 A compendium of thirty previously published open problems in computational geometry is presented.
arxiv
Characterization of Pentagons Determined by Two X-rays [PDF]
arXiv, 2006 This paper contains some results of pentagons which can be determined by two X-rays. The results reveal this problem is more complicated.
arxiv
Randomized Incremental Construction of Compressed Quadtrees [PDF]
arXiv, 2009 We present a simple randomized incremental algorithm for building compressed quadtrees. The resulting algorithm seems to be simpler than previously known algorithms for this task.
arxiv
Improved Examples of Non-Termination for Ruppert's Algorithm [PDF]
arXiv, 2011 Improving the best known examples, two planar straight-line graphs which cause the non-termination of Ruppert's algorithm for a minimum angle threshold as low as 29.06 degrees are given.
arxiv
Index notation of grid graphs [PDF]
arXiv, 2012 By defining grids as graphs, geometric graphs can be represented in a very concise way.
arxiv
Hilbert curves in 2 dimensions generated by L-systems [PDF]
arXiv, 2013 Generating Hilbert curves in Z^2 using L-systems appears to be efficient and ...
arxiv
Reducing Linear Programs into Min-max Problems [PDF]
arXiv, 2013 We show how to reduce a general, strictly-feasible LP problem, into a min-max problem, which can be solved by the algorithm from the third section of my thesis.
arxiv
Introducing article numbering to Computational Geometry: Theory and Applications
Computational geometry, 2020 S. Munao
semanticscholar +1 more source
The rank invariant stability via interleavings [PDF]
arXiv, 2014 A lower bound for the interleaving distance on persistence vector spaces is given in terms of rank invariants. This offers an alternative proof of the stability of rank invariants.
arxiv