egutierrez
faac610745
Extrae al registry funciones del proyecto interno footprint_aurgi: - core (6): slugify_ascii, normalize_for_join, cp_provincia_es, infer_provincia_from_cp, safe_read_csv_fallback, csv_to_parquet_duckdb - geo puras (7): haversine_km, point_in_ring, point_in_polygon, point_in_polygons_bbox, polygon_bbox, extent_with_padding, distance_bucket - geo I/O (4): load_geojson_polygons, load_boundary_gdf, add_basemap_osm, add_basemap_with_timeout - valhalla client (4): valhalla_route, valhalla_isochrone, valhalla_isochrones_async, valhalla_matrix_1_to_n - datascience stats (7): trimmed_mean, geometric_mean, detect_distribution_type, best_central_tendency, summary_stats, kde_density_levels, alpha_shape_concave_hull - datascience fuzzy (3): fuzzy_merge_adaptive (rapidfuzz), words_to_dataset, remove_words_from_column - datascience viz (2): plot_kde_2d, plot_heatmap_log - infra (4): compress_pdf_ghostscript, render_table_page_pdfpages, add_header_logo, osm2pgsql_ingest - pipelines (4): setup_geo_stack_docker, compute_centers_reachability, generate_isochrones_by_zone, count_points_per_zone - types geo (4): LonLat, BBox, IsochroneRequest, Centro Incluye: - apps/footprint_geo_stack/ (PostGIS + Martin + Valhalla via docker-compose) - 131/132 tests pasan (1 skip esperado: osm2pgsql en PATH) - Issue tracker dev/issues/0052-footprint-aurgi-extraction.md - Atribucion uniforme: source_repo internal:footprint_aurgi, source_license internal-aurgi - Build con 9 agentes en paralelo (8 wave 1 + 1 wave 2 pipelines) Tambien commitea trabajo previo no commiteado: aggregate_extraction_results, chunk_with_overlap, clean_pdf_text, merge_entity_aliases, extract_graph_gliner2, extract_relations_mrebel, extract_triples_spacy_es, gliner2/mrebel/marianmt/rebel/spacy_es load_model, parse_rebel_output, translate_es_to_en, issue 0050/0051. Co-Authored-By: Claude Opus 4.7 (1M context) <noreply@anthropic.com>
32 lines
955 B
Python
32 lines
955 B
Python
"""Ray casting para determinar si un punto esta dentro de un anillo (ring) poligonal."""
|
|
|
|
|
|
def point_in_ring(lon: float, lat: float, ring: list[tuple[float, float]]) -> bool:
|
|
"""Determina si el punto (lon, lat) esta dentro del anillo cerrado ring.
|
|
|
|
Usa el algoritmo de ray casting. Retorna False si len(ring) < 3.
|
|
|
|
Args:
|
|
lon: longitud del punto en grados.
|
|
lat: latitud del punto en grados.
|
|
ring: lista de vertices (lon, lat) que forman el anillo.
|
|
|
|
Returns:
|
|
True si el punto esta dentro del anillo, False en caso contrario.
|
|
"""
|
|
inside = False
|
|
n = len(ring)
|
|
if n < 3:
|
|
return False
|
|
j = n - 1
|
|
for i in range(n):
|
|
xi, yi = ring[i]
|
|
xj, yj = ring[j]
|
|
intersects = ((yi > lat) != (yj > lat)) and (
|
|
lon < (xj - xi) * (lat - yi) / (yj - yi + 1e-15) + xi
|
|
)
|
|
if intersects:
|
|
inside = not inside
|
|
j = i
|
|
return inside
|