The following pages link to Krzysztof Gdawiec (Q305012):
Displaying 50 items.
- On optimal disc covers and a new characterization of the Steiner center (Q283866) (← links)
- An almost optimal algorithm for Voronoi diagrams of non-disjoint line segments (Q283875) (← links)
- Distance-sensitive planar point location (Q283883) (← links)
- Metamorphosis of images in reproducing kernel Hilbert spaces (Q295375) (← links)
- Polynomiography based on the nonstandard Newton-like root finding methods (Q305015) (← links)
- Affine invariants of generalized polygons and matching under affine transformations (Q340532) (← links)
- Efficient and robust persistent homology for measures (Q340536) (← links)
- Polygon guarding with orientation (Q340539) (← links)
- Optimal randomized incremental construction for guaranteed logarithmic planar point location (Q340542) (← links)
- Closest pair and the post office problem for stochastic points (Q390124) (← links)
- Blended finite element method and its convergence for three-dimensional image reconstruction using \(L^2\)-gradient flow (Q482261) (← links)
- Binary univariate dual and primal subdivision schemes (Q489971) (← links)
- Structural pattern recognition with graph edit distance. Approximation algorithms and applications (Q518686) (← links)
- (Q590489) (redirect page) (← links)
- Approximation algorithms for the unit disk cover problem in 2D and 3D (Q680146) (← links)
- Generalized Bézier transformation (Q745600) (← links)
- New escape criteria for complex fractals generation in Jungck-CR orbit (Q828904) (← links)
- Segmentation of color images using mean curvature flow and parametric curves (Q830048) (← links)
- Algorithms for projecting a point onto a level surface of a continuous function on a compact set (Q889159) (← links)
- Computing the Fréchet distance between folded polygons (Q904083) (← links)
- An improved data stream algorithm for clustering (Q904105) (← links)
- Separating bichromatic point sets by L-shapes (Q904108) (← links)
- On the approximability of covering points by lines and related problems (Q904111) (← links)
- Discretization and approximation of surfaces using varifolds (Q1647912) (← links)
- Fractal patterns from the dynamics of combined polynomial root finding methods (Q1663711) (← links)
- On the length preserving approximation of plane curves by circular arcs (Q1682903) (← links)
- Incremental Voronoi diagrams (Q1688855) (← links)
- A novel cognitive transformation algorithm based on Gaussian cloud model and its application in image segmentation (Q1689456) (← links)
- Only distances are required to reconstruct submanifolds (Q1693317) (← links)
- On the number of touching pairs in a set of planar curves (Q1693324) (← links)
- Fractal descriptors of texture images based on the triangular prism dimension (Q1716781) (← links)
- Polynomiography for the polynomial infinity norm via Kalantari's formula and nonstandard iterations (Q1736112) (← links)
- Fluid image registration using a finite volume scheme of the incompressible Navier Stokes equation (Q1785027) (← links)
- Procedural generation of aesthetic patterns from dynamics and iteration processes (Q1787052) (← links)
- Approximating uniform rational B-spline curves by polynomial B-spline curves (Q1936132) (← links)
- Interproximate curve subdivision (Q1936134) (← links)
- Construction of global surfaces by variational evolutionary PDE splines (Q1936191) (← links)
- Chebyshev blossoming in Müntz spaces: toward shaping with Young diagrams (Q1946201) (← links)
- Approximate spline of \(G^2\)-continuity on a generalized hyperbolic paraboloid (Q1946211) (← links)
- Bisheh-Niasar-Saadatmandi root finding method via the \(S\)-iteration with periodic parameters and its polynomiography (Q1997529) (← links)
- Two-dimensional closest pair problem: a closer look (Q2004080) (← links)
- The Picard-Mann iteration with \(s\)-convexity in the generation of Mandelbrot and Julia sets (Q2041662) (← links)
- A novel approach to generate Mandelbrot sets, Julia sets and biomorphs via viscosity approximation method (Q2111270) (← links)
- Line segment visibility with sidedness constraints (Q2144449) (← links)
- An \(\Omega (n^d)\) lower bound on the number of cell crossings for weighted shortest paths in \(d\)-dimensional polyhedral structures (Q2144452) (← links)
- Control of dynamics of the modified Newton-Raphson algorithm (Q2206086) (← links)
- Newton's method with fractional derivatives and various iteration processes via visual analysis (Q2225511) (← links)
- On multigrid convergence of local algorithms for intrinsic volumes (Q2251260) (← links)
- Relaxing the constraints of clustered planarity (Q2261574) (← links)
- Conic nearest neighbor queries and approximate Voronoi diagrams (Q2261577) (← links)
