Curve Stabbing Depth: Data Depth for Plane Curves.
CCCG(2023)
摘要
Measures of data depth have been studied extensively for point data.
Motivated by recent work on analysis, clustering, and identifying
representative elements in sets of trajectories, we introduce {\em curve
stabbing depth} to quantify how deeply a given curve $Q$ is located relative to
a given set $\cal C$ of curves in $\mathbb{R}^2$. Curve stabbing depth
evaluates the average number of elements of $\cal C$ stabbed by rays rooted
along the length of $Q$. We describe an $O(n^3 + n^2 m\log^2m+nm^2\log^2
m)$-time algorithm for computing curve stabbing depth when $Q$ is an $m$-vertex
polyline and $\cal C$ is a set of $n$ polylines, each with $O(m)$ vertices.
更多查看译文
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要