DAA-A1-Line-Sweep-Algo
所属分类：其他
开发工具：C++
文件大小：0KB
下载次数：0
上传日期：2022-04-25 09:08:21
上 传 者：
sh-1993
说明： Bentley-Ottoman直线扫描算法的实现，以找到给定线段集的交点
(Implementation of the Bentley Ottoman Line Sweep Algorithm to find the points of intersection of a given set of line segments)
文件列表:
Algo.pdf (224708, 2022-04-25)
Doxyfile (13163, 2022-04-25)
Problem_Stmt.pdf (130028, 2022-04-25)
Reports/ (0, 2022-04-25)
Reports/daa-2.png (34988, 2022-04-25)
Reports/daa-3.png (36901, 2022-04-25)
Reports/daa-4.jpeg (84565, 2022-04-25)
Reports/daa.html (893, 2022-04-25)
event.hpp (11419, 2022-04-25)
findIntersections.hpp (12199, 2022-04-25)
input.txt (26, 2022-04-25)
intersection_pts.txt (35, 2022-04-25)
log.txt (134453, 2022-04-25)
main.cpp (2534, 2022-04-25)
output.txt (111507, 2022-04-25)
runtime_int.txt (254, 2022-04-25)
runtime_lin.txt (257, 2022-04-25)
status.hpp (12059, 2022-04-25)
# DAA-A1-Line-Sweep-Algo
Implementation of the Bentley Ottoman Line Sweep Algorithm to find the points of intersection of a given set of line segments
Run the main.cpp file by giving the following commands in the command prompt:
1. g++ main.cpp
2. ./a.out
The main.cpp contains the driver code.
1. findIntersections.hpp
2. event.hpp
3. status.hpp
files contain the helper classes and structures.
To generate the documentation, run
"doxygen doxyfile"
in the command prompt and then open index.html in the Documentation->HTML folder for the doxygen generated documentation.
Open daa.html in the Reports folder for the HTML report.
The text files contain the inputs and outputs.
P.S: The algo isn't currently finding intersection points with negative coordinates.
近期下载者：
相关文件：
收藏者：