A new construction of forests with low visibility

Abstract A set of points with finite density is constructed in , with , by adding points to a Poisson process such that any line segment of length in will contain one of the points of the set within distance of it. The constant implied by the big‐ notation depends on the dimension only.

Authors

Institutions

Publication Details

Journal
Mathematika
Published
2025-02-07
DOI
https://doi.org/10.1112/mtk.70013
Primary Topic
Computational Geometry and Mesh Generation
Type
article
Field-Weighted Citation Impact
0.00

Funders

Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

A new construction of forests with low visibility

Kirill Kashkan
Mathematika
Computational Geometry and Mesh Generation
article

A new construction of forests with low visibility

Kirill Kashkan
article en

Abstract

Abstract A set of points with finite density is constructed in , with , by adding points to a Poisson process such that any line segment of length in will contain one of the points of the set within distance of it. The constant implied by the big‐ notation depends on the dimension only.

MathematikaVol. 71(2)
University of Toronto (CA)
Deutsche Forschungsgemeinschaft, Natural Sciences and Engineering Research Council of Canada
Openalex Percentile: Top 97%
Computational Geometry and Mesh Generation
DOIOpen Access PDFOpenAlex
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.

A new construction of forests with low visibility — Kirill Kashkan · Mathematika (2025) | TGRS Research Map | TGRS