Implement Geospatial Algorithms for GIS and Location-Based Services

This issue is dedicated to implementing geospatial algorithms in Python for geographic information systems (GIS) and location-based services. Geospatial algorithms can include point-in-polygon checks, distance calculations, geospatial indexing, and other spatial operations.

The proposed changes for this issue include:

Implementing geospatial algorithms for point-in-polygon checks to determine if a point is inside a polygon.
Developing algorithms for calculating distances between geographical coordinates using various methods (e.g., Haversine formula).
Creating geospatial indexing structures like quad trees or R-trees to optimize spatial data queries.
Providing clear and concise documentation for the implemented geospatial algorithms, including examples and usage instructions.

The benefits of implementing this feature are as follows:

Enhanced geospatial capabilities: Users can perform geospatial operations for GIS, location-based services, and spatial data analysis.
Improved project versatility: The addition of geospatial algorithms broadens the project's applications in geographic and location-oriented contexts.

_Please Assign me this issue under hacktoberfest 2023 and hacktoberfest-accepted_