Results 71 to 80 of about 939,183 (156)
Computational Geometry Column 34 [PDF]
SIGACT News, 29(3) (Issue 108) 27-32, Sept. 1998, 1998 Problems presented at the open-problem session of the 14th Annual ACM Symposium on Computational Geometry are listed.
arxiv
Multi-scale hash encoding based neural geometry representation
Computational Visual MediaRecently, neural implicit function-based representation has attracted more and more attention, and has been widely used to represent surfaces using differentiable neural networks.
Z. Deng +4 more
semanticscholar +1 more source
No dimension independent Core-Sets for Containment under Homothetics
, 2012 This paper deals with the containment problem under homothetics which has the minimal enclosing ball (MEB) problem as a prominent representative. We connect the problem to results in classic convex geometry and introduce a new series of radii, which we ...
Brandenberg, Rene, Koenig, Stefan
core +1 more source
Megamaps: Construction and Examples [PDF]
Discrete Mathematics & Theoretical Computer Science, 2001 We consider the usual model of hypermaps or, equivalently, bipartite maps, represented by pairs of permutations that act transitively on a set of edges E.
Alexander Zvonkin
doaj +1 more source
Computational Geometry Column 37 [PDF]
arXiv, 1999 Open problems from the 15th Annual ACM Symposium on Computational Geometry.
arxiv
q-gram analysis and urn models [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 Words of fixed size q are commonly referred to as $q$-grams. We consider the problem of $q$-gram filtration, a method commonly used to speed upsequence comparison. We are interested in the statistics of the number of $q$-grams common to two random texts (
Pierre Nicodème
doaj +1 more source
Computational Geometry Column 33 [PDF]
Internat. J. Comput. Geom. Appl., 8(3) 381-384, 1998. Also in
SIGACT News, 29(2) (Issue 107) 14-16, 1998, 1998 Several recent SIGGRAPH papers on surface simplification are described.
arxiv
Advances in Computational Mathematics, 2018 Latin squares are used as scramblers on symmetric-key algorithms that generate pseudo-random sequences of the same length. The robustness and effectiveness of these algorithms are respectively based on the extremely large key space and the appropriate ...
Raúl M. Falcón, V. Álvarez, F. Gudiel
semanticscholar +1 more source
Configuration Spaces Of Convex And Embedded Polygons In The Plane [PDF]
, 2014 This paper concerns the topology of configuration spaces of linkages whose underlying graph is a single cycle. Assume that the edge lengths are such that there are no configurations in which all the edges lie along a line.
Shimamoto, Don H. +1 more
core +1 more source
Rooted trees and moments of large sparse random matrices [PDF]
Discrete Mathematics & Theoretical Computer Science, 2003 In these expository paper we describe the role of the rooted trees as a base for convenient tools in studies ofrandom matrices. Regarding the Wigner ensemble of random matrices, we represent main ingredients ofthis approach.
Oleksiy Khorunzhiy
doaj +1 more source