Map Drawer — Draw Shapes, Polygons & Paths

Points, lines and shapes: what you can draw on a map

Map drawing in modern Geographic Information Systems (GIS) is the computational process of vector digitization—translating real-world geographic features into discrete mathematical primitives:

• Points: A single coordinate pair representing discrete assets (trees, delivery stops, survey monuments).
• Polylines (LineStrings): An ordered array of vertices connected by straight line segments, representing linear networks (highways, rivers, utility trenches, hiking tracks).
• Polygons: A closed sequence of four or more vertices where the first and last coordinates are identical, defining contiguous geographic regions (property lots, zoning districts, lakes).

Under the international RFC 7946 GeoJSON specification, coordinates are stored in the mathematical order [Longitude, Latitude, Elevation] (X, Y, Z order), matching standard Cartesian planes.

Rules for drawing valid shapes

Creating professional GIS data requires adhering to strict mathematical topological integrity:

How line simplification works

When users draw freehand curves or import raw GPS tracks containing tens of thousands of GPS breadcrumbs, the raw GeoJSON payload can balloon to dozens of megabytes, causing browser rendering lag.

To optimize geometry without sacrificing visual fidelity, spatial engines apply the Ramer-Douglas-Peucker (RDP) algorithm:

The algorithm draws a baseline chord connecting the line's starting point and ending point. It calculates the perpendicular distance from every intermediate vertex to that chord. If the maximum perpendicular distance is less than a designated tolerance threshold ε, all intermediate vertices are discarded. If it exceeds ε, the line is split at that vertex and the algorithm recurses on both halves.

This recursive process routinely eliminates 70% to 90% of redundant vertices while maintaining millimeter-accurate visual curvature.

Example: deciding which points to drop

The perpendicular distance d from candidate vertex P(x₀, y₀) to the baseline vector connecting endpoints A(x₁, y₁) and B(x₂, y₂) is calculated via planar geometry:

GeoJSON geometry types reference

Reference this authoritative directory detailing vector geometry dimensions, minimum vertex counts, and winding rules:

Limitations of drawing on a web map

When drafting custom vector geometries on web maps, cartographers must manage several common computational hurdles:

• Antimeridian Cutting (-180° / +180°): When drawing a polygon spanning the Pacific Ocean across the 180th meridian (such as Fiji or Alaska's Aleutian Islands), naive map renderers draw horizontal streaks across the entire world map. The geometry must be sliced into a MultiPolygon split at -180° and +180°.
• Sliver Polygons & Gaps: Manually tracing adjacent boundaries (such as neighboring counties or property lots) without snapping leads to micro-gaps or microscopic overlaps known as sliver polygons, creating erroneous boundary conflicts.
• DOM Rendering Overload: Rendering over 10,000 individual SVG polygon nodes directly in the browser DOM causes frame-rate stutter; large datasets should be rendered via HTML5 Canvas or WebGL shaders (MapLibre / Mapbox GL).