凸包算法
内容导读
互联网集市收集整理的这篇技术教程文章主要介绍了凸包算法,小编现在分享给大家,供广大互联网技能从业者学习和参考。文章包含1921字,纯文字阅读大概需要3分钟。
内容图文
![凸包算法](/upload/InfoBanner/zyjiaocheng/639/530de4ccad1c4edaa9c678101b780d8a.jpg)
ThirdConvexHull.h
#pragma once
class CThirdConvexHull
{
public:
CThirdConvexHull();
~CThirdConvexHull();
public:
static AcGePoint3dArray testConvexHullPoints(AcGePoint3dArray& pts);
};
ThirdConvexHull.cpp
#include "stdafx.h"
#include "ThirdConvexHull.h"
#include <cstdio>
#include <cstring>
#include <cstdlib>
#include <algorithm>
#include <cmath>
using std::sort;
#define MAXN 1002
int N, L;
double sqr(double a)
{
return a*a;
}
struct Point
{
double x, y;
inline Point operator- (const Point &t)
{
Point ret;
ret.x = x - t.x;
ret.y = y - t.y;
return ret;
}
inline Point operator+ (const Point &t)
{
Point ret;
ret.x = x + t.x;
ret.y = y + t.y;
return ret;
}
inline int det(const Point &t)
{
return x*t.y - t.x*y;
}
inline double dist(Point &t)
{
return sqrt(sqr(x - t.x) + sqr(y - t.y));
}
}d[MAXN];
bool cmpPoint(const Point &a, const Point &b)
{
if (a.x != b.x) return a.x < b.x;
return a.y < b.y;
}
int convex[MAXN], cTotal;
void get_convex_hull()
{
sort(d, d + N, cmpPoint);
int Total = 0, tmp;
for (int i = 0; i < N; ++i)
{
while ((Total > 1) &&
((d[convex[Total - 1]] - d[convex[Total - 2]]).det(
d[i] - d[convex[Total - 1]]) <= 0)) Total--;
convex[Total++] = i;
}
tmp = Total;
for (int i = N - 2; i >= 0; --i)
{
while ((Total > tmp) &&
((d[convex[Total - 1]] - d[convex[Total - 2]]).det(
d[i] - d[convex[Total - 1]]) <= 0)) Total--;
convex[Total++] = i;
}
cTotal = Total;
}
CThirdConvexHull::CThirdConvexHull()
{
}
CThirdConvexHull::~CThirdConvexHull()
{
}
AcGePoint3dArray CThirdConvexHull::testConvexHullPoints(AcGePoint3dArray& pts)
{
AcGePoint3dArray outpts;
N = pts.length();
for (int i = 0; i < N; ++i)
{
d[i].x = pts[i].x;
d[i].y = pts[i].y;
}
get_convex_hull();
double Ans = 0;
for (int i = 0; i < cTotal; ++i)
{
AcGePoint3d tempt;
tempt.x = d[convex[i]].x;
tempt.y = d[convex[i]].y;
tempt.z = 0;
outpts.append(tempt);
//acutPrintf(_T("\n%2f,%2f,0"), d[convex[i]].x, d[convex[i]].y);
}
return outpts;
}
内容总结
以上是互联网集市为您收集整理的凸包算法全部内容,希望文章能够帮你解决凸包算法所遇到的程序开发问题。 如果觉得互联网集市技术教程内容还不错,欢迎将互联网集市网站推荐给程序员好友。
内容备注
版权声明:本文内容由互联网用户自发贡献,该文观点与技术仅代表作者本人。本站仅提供信息存储空间服务,不拥有所有权,不承担相关法律责任。如发现本站有涉嫌侵权/违法违规的内容, 请发送邮件至 gblab@vip.qq.com 举报,一经查实,本站将立刻删除。
内容手机端
扫描二维码推送至手机访问。