A

Mini Project
On

“ LEY LINES”
Submitted By

[Link] NAME OF STUDENT ROLL NO.

1 ARIN SADANAND IRACHE 81

2 Nikhil Sanjay Kanjarbhat 97

3 Jyotiraditya Prakash patil 87

Under the Guidance of

MR. R. S. SHINDE.

Department of Computer Science & Engineering

School of Engineering & Technology

D. Y. Patil Agriculture & Technical University, Talsande

Academic Year: 2023-24
 D. Y. Patil Agriculture & Technical University,
Talsande
Department of Computer Science & Engineering

Certificate
This is to certify that the Mini Project work entitled

“LEY LINES”
submitted by
[Link] NAME OF STUDENT ROLL NO.
1 ARIN SADANAND IRACHE 81

2 Nikhil Sanjay Kanjarbhat 97

3 Jyotiraditya Prakash patil 87

in partial fulfillment of requirement for the Semester-I of Second Year in

Computer Science & Engineering. This is a record of their work carried out
by them under supervision and guidance during academic year 2023-24.
Place: Date:

MR. R. S. SHINDE Mr. S. A. Kumbhar Dr. S. T. Patil

Name of Guide Project coordinator HOD CSE

External Examiner
 ACKNOWLEDGMENT
We take pleasure in presenting our work done for the project entitled as
“LEY LINES”.
We express our sincere thanks to MR. R.S. SHINDE. whose supervision,
inspiration and valuable guidance helped us a lot to complete the project.
His guidance proved to be the most valuable to overcome all the hurdles in
the fulfillment of this project work.
We are very much thankful to Mr. S. A. Kumbhar, Project coordinator and
Dr. S. T. Patil, HOD CSE for their kind support and valuable guidance. We
would also express gratitude towards our colleagues and friends for the
moral and technical support throughout the duration of project work. Also
we are thankful to all those who have helped us in the completion of the
project work.

[Link] NAME OF STUDENT ROLL NO. SIGN

1 ARIN SADANAND IRACHE 81

2 Nikhil Sanjay Kanjarbhat 97

3 Jyotiraditya Prakash patil 87

 D.Y. Patil Agriculture & Technical University, Talsande
PROJECT PROGRESS REPORT

Name 1: Arin Sadanand Irache.

Name 2: Nikhil Sanjay Kanjarbhat.
Name 3: Jyotiraditya Prakash Patil.

Roll No 81,97,87

Report Period 1/10/23-15/10/2023

Name Of Project Ley lines

Activity Task Resource Used

TEAM INTRODUCTION ONLINE AND OFFLINE MEETING FOR
ANALYSIS AND DISSCUSION ACM-ICPC 202O PROBLLEM
SET ‘F’.

Conclusion

Gained deeper understanding about the given system and the client requirements
determined the work ethic which is to be followed for the upcoming task
 Project name: ley lines Class: SY. CSE 2023

D.Y. Patil Agriculture & Technical University, Talsande

PROJECT PROGRESS REPORT

Name 1: Arin Sadanand Irache.

Name 2: Nikhil Sanjay Kanjarbhat.
Name 3: Jyotiraditya Prakash Patil.

Roll No 81,97,87

Report Period 15/10/23-30/10/2023

Name Of Project Ley lines

Activity Task Resource Used

SRS AND DESIGN CONDUCTED SEVERAL OFFLINE MEETINGS

DOCUMENT AND WORKED ON DESIGN OF THE CODE AND
DEVELOPMENT SRS.
ACM-ICPC 202O PROBLLEM
SET ‘F’.

Conclusion

D. Y. Patil Agriculture & Technical University, Talsande

 Project name: ley lines Class: SY. CSE 2023

D.Y. Patil Agriculture & Technical University, Talsande

PROJECT PROGRESS REPORT

Gained deeper understanding about the process of measuring the distance calculation
using points given by user.

Name 1: Arin Sadanand Irache.

Name 2: Nikhil Sanjay Kanjarbhat.
Name 3: Jyotiraditya Prakash Patil.

Roll No 81,97,87

Report Period 1/11/23-15/11/2023

Name Of Project Ley lines

Activity Task Resource Used

D. Y. Patil Agriculture & Technical University, Talsande

 Project name: ley lines Class: SY. CSE 2023

D.Y. Patil Agriculture & Technical University, Talsande

PROJECT PROGRESS REPORT

CODE DEVELOPMENT
DEVELOPED THE STRUCTURE OF THE CODE
AND DESIGN DOCUMENT ACM-ICPC 202O PROBLLEM
SET ‘F’.

Conclusion

Refined the algorithm of formation of line using points .

Name 1: Arin Sadanand Irache.

Name 2: Nikhil Sanjay Kanjarbhat.
Name 3: Jyotiraditya Prakash Patil.

Roll No 81,97,87

Report Period 16/11/23-30/11/2023

D. Y. Patil Agriculture & Technical University, Talsande

 Project name: ley lines Class: SY. CSE 2023

D.Y. Patil Agriculture & Technical University, Talsande

PROJECT PROGRESS REPORT

Name Of Project Ley lines

Activity Task Resource Used

VALIDATION STUDIES
USER INTERFACE AND DEVELOPMENT ACM-ICPC 202O PROBLLEM
SET ‘F’.

Conclusion

Exploring the development of a user friendly interface .

D. Y. Patil Agriculture & Technical University, Talsande

5

10

12

15

16
 CHAPTER 01:
INTRODUCTION

1.1 Problem statement:

• The concept of ley lines, introduced by Alfred Watkins in 1921, posits the existence of
straight lines connecting places of geographical and historical significance. These
lines have often been associated with mystical theories. A common criticism of ley
lines is their susceptibility to being drawn on a map as lines of non- zero width. This
problem focuses on addressing this criticism within a simplified, two dimensional
plane. Assuming a set of points with unique (x, y) coordinates and no three points
collinear, we aim to determine the maximum number of points that can be connected
by a single line given the width of the drawing tool. This investigation aims to offer
a mathematical perspective on the feasibility and limitations of ley lines as straight
connections between points of interest.

1.2 Problem Description:

 Connecting Points with Limited Line Width 
Given:
• A set of points in a two-dimensional plane, each with unique (x, y) coordinates.
• No three points are collinear (i.e., no straight line can pass through exactly three
points).
• A drawing tool with a non-zero width.
 Objective:
• Find the maximum number of points that can be connected by a single, straight line on
the plane, considering the width of the drawing tool.
 Constraints:
• The line connecting the points cannot have any gaps or overlaps due to the tool's
width.
• No point can be connected to the line if it falls outside the width of the line from any
point already on the line.
 Problem Focus:
• Address the criticism that ley lines, drawn as lines of non-zero width on a map, are
susceptible to being falsely identified due to the possibility of fitting points within the
line's width even if they are not truly aligned.
• Offer a mathematical approach to assess the feasibility and limitations of drawing
straight lines connecting points of interest while accounting for real-world constraints
like the width of a drawing tool.
 Benefits:
• Provides a quantitative analysis of the likelihood of ley lines existing as physically
connected features on the landscape.
• Helps distinguish intentional alignments from random coincidences within the
context of limited drawing precision.

• Offers a framework for applying similar analysis to other scenarios involving line
connections with non-zero width constraints.

1.3 Software Requirement Specification:

• Purpose:--
The purpose of the ley lie is to the aim of focus of the research which is posits of straight
lines connecting
co-ordinates with non zero thickness line in two dimensional plane .
 Scope:--
The main goal of this search is to figure out how the operation of connecting two points
using thickness t of a pencil can work. This can be useful in many different ways to
show two connected historical places like ley line project .

 Definition, Acronyms, Abbreviation: -

Ley lines is the part in which historical places connected by non-zero thickness line which
have mystical theories.

• References: --
https:/[Link]/worldfinals/past-problems

 Developer’s Responsibilities:--
The developer is responsible for
[Link] the system
[Link] the software on client machine.
[Link] the user how system will work.

 Product function overview

The command function of this design which makes our ley line quite difficult . It have
protocol of connecting points in single line of non-zero thickness. It takes a set of unique
(x, y) co-ordinates and the thickness of the pencil as a input.
The function essentially explores geometric consideration to optimize the alignment of
points within the specified line width.

 user characteristics
User may have an analytical mindset to assess and address the criticism related to ley
lines and pencil thickness.

• General constraints
The system will run on any machine having c compiler.
 INPUT AND OUTPUT
Sample input 1 sample output 1 sample output 2 sample output 2

4 2 3 3 1 2
0 10
0 0
2000 10
2 4 1000 12
4 9
3 1

 FUNCTIONAL REQUIREMENTS
1. Determine the system to handle varying densities of points and different pencil
thickness without compromising performance.
Input 1:-
A] The system should accept set of points on a plane , where each point is represented by
unique (x, y) .
B] The system should allow the user to input the thickness of he pencil used for drawing
lines.
C] The system must ensure that the set of points provided contains no duplicate , and no
three points lie on a single straight line.
D] Implement an algorithm to calculate the largest number of points through which a
single line can be drawn, considering the specified pencil thickness.
E] The algorithm should take into account the non-zero width of the line and find valid
connection between points.

 EXTERNAL INTERFACE REQUIREMENTS

User interface:-
Develop a user friendly interface for inputting points and pencil Thickness.
Display the output in a clear and understandable manner , informing the user of the
result.

• Performance constraints
 For input 1 contain (x, y ) co-ordinate and ‘t’ no. thickness to connect line with non-zero
width.

 Design constraints
Software constraints
The system will run on any machine having c compiler.
Hardware constraints
He system will run on a window 10 and minimum 2 Gb ram , 64 bit operating system.

Acceptance Criteria
Before accepting the system, the developer must demonstrate that the
system works on concept of Voronoi diagrams. This would give you an
estimate of the maximum number of points connected by line considering the
thickness of the pencil.

Chapter 02:
DESIGN

2.1 Function Oriented Design:

Data Flow Diagram (Level 0):

 DATA FLOW DIAGRAM:

FUNCTIONS: -
1. ’POINT’ STRUCTURE:

REPRESENT A POINT WITH X AND Y CO-ORDINATES

2. ’SHORTESTDISTLINE’ FUCTION()

Calculate the shortest distance from a point (x ,y) to a line ax+by+c=0;

Use the formula ‘fabs(a*x +b*y +c )/ sqrt(a*a +b*b)’;

3. ‘ numPts’ Function()

Finds the maximum number of points lying on the same line.

Iterates over all pairs of points and calculates the coefficients (a, b, c) of the line
equation for each pair.

Checks each point to see if it lies within the specified distance (t) to the line.

Updates the maximum count if the current count is greater.

4. ’MAIN’ FUNCTION()

Main Function of program.

In summary, the program takes input for the number of points and a distance
threshold. It then finds the maximum number of points lying on the same line by
iterating through all pairs of points and checking for other points within the
specified distance to the line. The result is printed in the main function.
 CHAPTER NO. 03:
CODING

3.1 Algorithms:

1. Input:
• Read the number of points (n) and the thickness of the pencil (t).
• Read the coordinates (x, y) of each point.

2. Iterate through all possible pairs of points:

• For each pair of points (i, j):
o Calculate the equation of the line passing through them
CHAPTER NO. 04:
TESTING.
 4.1 Test Cases and Test Report:

Column1 Column2 Column3 Column4 Column5 Column6 Column7 Column8 Column9

Test Case ID TC001 Test Case Description Test the Sum Module

Created By Arin irache Reviewed By Jyotiraditya patil Version 2.1

Tester's Name Nikhil Date Tested 1-Jan-2017 Test Case pass

kanjarbhat (Pass/Fail/Not
Executed)

TCNO. Input Data Expected Results Actual Results Pass / Fail /

Not executed
/ Suspended
1 ENTER NO. OF POINTS AND Pass
THICKNESS OF PENCIL
3 4 ENTER 1 pair of
point. Max no. of pts are 3 Max no. of pts are:- 3
34
ENTER 2 pair of point.4 5
ENTER 3 pair of point.6 7

2 ENTER NO. OF POINTS AND pass.

THICKNESS OF PENCIL
4 2 ENTER 1 pair of
point.
0 0 ENTER 2 pair of
point. Max no. of pts are:- 3 Max no. of pts are:- 3
2 4 ENTER 3 pair of
point.
49
ENTER 4 pair of point.
31
3 ENTER NO. OF POINTS AND pass
THICKNESS OF PENCIL
3 1 ENTER 1 pair of
point.
0 10 Max no. of pts are:- 2 Max no. of pts are:- 2
ENTER 2 pair of point.
2000 10 ENTER 3 pair
of point.
1000 12
4 ENTER NO. OF POINTS more pass.
AND THICKNESS OF PENCIL
4 5 ENTER 1 pair of
point.
45
ENTER 2 pair of point. Max no. of pts are:- 2 Max no. of pts are:- 2
1234 45
ENTER 3 pair of point.
3456 56 ENTER 4 pair
of point.
45 6789
 CHAPTER NO. 05:
OUTPUT SCREENSHOT.

SCREENSHOT 1:

SCREENSHOT 2:
SCREENSHOT 3:

SCREENSHOT 4:
CHAPTER NO. 06: CONCLUSION

Conclusion:
The program satisfies the needs of User and the design
is considered to be finalised
  REFERENCE.

• ICPC-2020 PROBLEM SET ‘F’.

• [Link] for [Link]/
• Chatgpt, [Link]
• Documentation [provided by mentors, some blogs
,articles etc.]