相关论文: Construction algorithms for plane nets in base $b$

The class of $(t,m,s)$-nets and $(t,s)$-sequences, introduced in their most general form by Niederreiter, are important examples of point sets and sequences that are commonly used in quasi-Monte Carlo algorithms for integration and…

We study the probabilistic existence of point configurations satisfying the $(0, m, d)$-net property in base $b$ within a randomly generated point set of size $N$ in the $d$-dimensional unit cube. We first derive an upper bound on the…

We study numerical integration on the unit sphere $\mathbb{S}^2 \subset \mathbb{R}^3$ using equal weight quadrature rules, where the weights are such that constant functions are integrated exactly. The quadrature points are constructed by…

The classes of $(u,m,{\bf e},s)$-nets and $(u,{\bf e},s)$-sequences were recently introduced by Tezuka, and in a slightly more restrictive form by Hofer and Niederreiter. We study propagation rules for these point sets, which state how one…

We study the quasi-uniformity properties of digital nets, a class of quasi-Monte Carlo point sets. Quasi-uniformity is a space-filling property used for instance in experimental designs and radial basis function approximation. However, it…

In this paper we give explicit constructions of point sets in the $s$ dimensional unit cube yielding quasi-Monte Carlo algorithms which achieve the optimal rate of convergence of the worst-case error for numerically integrating high…

We present an algorithm for detecting basepoints of linear series of curves in the plane. Moreover, we give an algorithm for constructing a linear series of curves in the plane for given basepoints. The underlying method of these algorithms…

This paper completes the classification of nets of conics containing at least one double line in $\mathrm{PG}(2,q)$ for $q$ even. This classification contributes to the classification of partially symmetric tensors in $\mathbb{F}_q^3…

We study the dispersion of digital $(0,m,2)$-nets; i.e. the size of the largest axes-parallel box within such point sets. Digital nets are an important class of low-discrepancy point sets. We prove tight lower and upper bounds for certain…

We investigate $k$-nets with $k\geq 4$ embedded in the projective plane $PG(2,\mathbb{K})$ defined over a field $\mathbb{K}$; they are line configurations in $PG(2,\mathbb{K})$ consisting of $k$ pairwise disjoint line-sets, called…

We introduce an algorithm to reduce large data sets using so-called digital nets, which are well distributed point sets in the unit cube. These point sets together with weights, which depend on the data set, are used to represent the data.…

The present work considers the properties of classes of generally convex sets in the plane known as $1$-semiconvex and weakly $1$-semiconvex. More specifically, the examples of open and closed weakly $1$-semiconvex but non $1$-semiconvex…

The aim of this paper is to compute the class of the closure of the effective divisor in M_{6,1} given by pointed curves [C,p] with a sextic plane model mapping p to a double point. Such a divisor generates an extremal ray in the…

It is well-known that digital $(t,m,s)$-nets and $(\Tfett,s)$-sequences over a finite field have excellent properties when they are used as underlying nodes in quasi-Monte Carlo integration rules. One very general sub-class of digital nets…

Extracting planes from a 3D scene is useful for downstream tasks in robotics and augmented reality. In this paper we tackle the problem of estimating the planar surfaces in a scene from posed images. Our first finding is that a surprisingly…

The paper proposes, an algorithm to produce novel m-point (for any integer m>=2) binary non-stationary subdivision scheme. It has been developed using uniform trigonometric B-spline basis functions and smoothness is being analyzed using the…

A procedure for the construction and the classification of multilattices in arbitrary dimension is proposed. The algorithm allows to determine explicitly the location of the points of a multilattice given its space group, and to determine…

The second author recently suggested to identify the generating matrices of a digital $(t,m,s)$-net over the finite field $F_q$ with an $s \times m$ matrix $C$ over $F_{q^m}$. More exactly, the entries of $C$ are determined by interpreting…

Higher order digital nets are special classes of point sets for quasi-Monte Carlo rules which achieve the optimal convergence rate for numerical integration of smooth functions. An explicit construction of higher order digital nets was…

We investigate the use of order $2$ digital nets for quasi-Monte Carlo quadrature of nonperiodic functions with bounded mixed second derivative over the cube. By using the so-called tent transform and its mapping properties we inherit error…