算法:笛卡尔平面坐标系上,若干连接点形成线,剔除距离小于阈值的点,Kotlin

算法:笛卡尔平面坐标系上,若干连接点形成线,剔除距离小于阈值的点,Kotlin

Kotlin 复制代码
const val THRESHOLD = 0.6f //距离小于这个点将被剔除。

data class Point(val x: Float, val y: Float)

fun removeNearbyPoint(points: List<Point>): List<Point> {
    val result = mutableListOf<Point>()
    var prevPoint: Point? = null

    for (point in points) {
        if (prevPoint == null || distance(prevPoint, point) > THRESHOLD) {
            result.add(point)
            prevPoint = point
        }
    }

    return result
}

fun distance(p1: Point, p2: Point): Float {
    val dx = p2.x - p1.x
    val dy = p2.y - p1.y
    return kotlin.math.sqrt(dx * dx + dy * dy)
}

fun main(args: Array<String>) {
    val points = listOf(
        Point(0.0f, 0.0f),
        Point(0.1f, 0.1f),
        Point(0.5f, 0.5f),
        Point(0.6f, 0.6f),
        Point(1.0f, 1.0f),
        Point(1.4f, 1.4f),
        Point(1.5f, 1.5f),
        Point(2.0f, 2.0f),
        Point(2.5f, 2.5f),
        Point(3.0f, 3.0f),
        Point(3.5f, 3.5f),
        Point(4.0f, 4.0f)
    )

    val result = removeNearbyPoint(points)

    println("原来的点 ${points.size} : $points")
    println("处理的点 ${result.size} : $result")
}

原来的点 12 : Point(x=0.0, y=0.0), Point(x=0.1, y=0.1), Point(x=0.5, y=0.5), Point(x=0.6, y=0.6), Point(x=1.0, y=1.0), Point(x=1.4, y=1.4), Point(x=1.5, y=1.5), Point(x=2.0, y=2.0), Point(x=2.5, y=2.5), Point(x=3.0, y=3.0), Point(x=3.5, y=3.5), Point(x=4.0, y=4.0)

处理的点 9 : Point(x=0.0, y=0.0), Point(x=0.5, y=0.5), Point(x=1.0, y=1.0), Point(x=1.5, y=1.5), Point(x=2.0, y=2.0), Point(x=2.5, y=2.5), Point(x=3.0, y=3.0), Point(x=3.5, y=3.5), Point(x=4.0, y=4.0)

networkx节点2D网格,Python_networkx 绘制棋盘格_zhangphil的博客-CSDN博客文章浏览阅读883次。此种类型2D网格图,类似于棋盘等。import networkx as nximport matplotlib.pyplot as pltdef my_graph(): G = nx.grid_2d_graph(4, 4) pos = nx.spring_layout(G, iterations=100) # nrows=2,ncols=2,index=1 plt.subplot(2, 2, 1) nx.draw(G, pos, font_size=_networkx 绘制棋盘格https://blog.csdn.net/zhangphil/article/details/121150370

相关推荐
Tim_1010 分钟前
【LeetCode】338、比特位计数
c++·算法·leetcode
木子算法25 分钟前
不是重心也不是中点:费马—韦伯点、它的最优性条件与迭代求解
人工智能·算法·目标跟踪
ai2work1 小时前
附录 D 速查索引与阅读指南
kotlin
ai2work1 小时前
ch22 诊断方法论:三个真实事故的根因分析
kotlin
tryxr1 小时前
矩阵的几种基础变换
java·数据结构·算法·矩阵
mmmmath_32 小时前
LeetCode.028.找出字符串中第一个匹配项的
数据结构·算法·leetcode
Selvaggia2 小时前
DMD(Distribution Matching Distillation,分布匹配蒸馏)
算法
Navigator_Z2 小时前
LeetCode //C - 1255. Maximum Score Words Formed by Letters
c语言·算法·leetcode
All for pursuit.2 小时前
【栈-4】739.每日温度
数据结构·c++·算法·leetcode
Kapaseker2 小时前
你有搞明白 Volatile 什么意思吗?
android·kotlin