Contour Map Creator 0.402improvement ideas
Sampling
North West corner
Latitude: Longitude:
South East corner
Latitude: Longitude:
Sampling Poinst:
N-S axis: step size: W-E axis: step size:
Plot Options
  Units:
Rounding for legend (decimal places):  
Save/Load Cookie
Other Options

Instructions

Go to the desired location in the map, set two markers by clicking the map to define a rectangle (or enter coordinates manually). Click the button [get data]. Optionally you can change the number of elevation samples you want in each direction, the more the better (max 400). You can also change the number of contours or set custom contour values. You can save some data in cookies, however there is a limit. Use the manual saving text areas below alternatively.

This service comes without any warranty whatsoever, including but not limited to functioning or correctness.

Resources: This service uses ArcGIS Map by Esri, the OpenStreetMap, Geocoding by Nominatim, Mapzen, Leaflet, jQuery and the CONREC contouring algorithm by Paul Bourke and Jason Davies.

Created by Christoph Hofstetter (christophhofstetter (at) gmail.com) 2013-2025

Visit my other projects at urgr8.ch and Living in Natural Harmony.

Elevation Data

min:
max:

Save Data


Copy data and save somewhere

Load Data


Paste data back here and click button below

Save Contour Map as an SVG file

If you want to have the contour maps as an individual layer (e.g. to create overlays) you can copy the code underneath the image below and save it as an svg file. Please note, as for now, the drawing below is square and you may want to stretch it to cover the actual area in a map.

Download SVG file
Download KML file

Version History

Version Modification Date
0.402 - fixed elevation 0 issue for KML export 17.06.2025
0.401 - extended search engine to include whole addresses 16.06.2025
0.400 - updated version with leaflet and alternative maps
- added scale
- improved search for cities		 04.06.2025
0.314 - fixing issue with svg file (not opening) 06.10.2019
0.313 - fixing issue with kml file (google earth import) 29.07.2019
0.312 - fixing issue with https connections 21.07.2019
0.311 - added download link for KML file 27.01.2019
0.310 - fix for google map API 12.10.2018
0.309 - added download link for SVG file 01.04.2017
0.308b - resolved an issue with get data 21.02.2017
0.308 - quick fix after malfunction 03.11.2013
0.307 - corrected line scramble issue
- added rounding option		 18.09.2013
0.306 - added choice to select units (m or ft)
- added fullscreen option		 09.09.2013
0.305 - added saving as svg 08.09.2013
0.304 - added searching
- modified layout		 20.08.2013
0.303 - added plotting of sample points 19.08.2013
0.302 - added saving in cookie 19.08.2013
0.301 - added feature request link
- added interval mode for contours added interval mode for contours
- added manual map export/import		 18.08.2013


Nxnxn Rubik 39scube Algorithm Github Python Verified

The cubesolve project emphasizes : the model, the viewer, and the solver are completely separated, allowing you to enhance or replace the solving algorithm without breaking the visualization or input handling. This modular architecture is key to building a maintainable and testable system.

This public link is valid for 7 days and shares a thread, including any personal information you added. This link or copies made by others cannot be deleted. If you share with third parties, their policies apply. Can’t copy the link right now. Try again later.

Are you ready to build your own NxNxN cube solver? The tools are in your hands—and they're all open source. The code is there to read, modify, and make your own. So why not give it a spin? Create a 100x100x100 cube, scramble it, and watch your algorithm work its magic.

Python's standard interpreter (CPython) can be slow for the heavy computation required for large cube pruning tables. To achieve "verified" fast performance: nxnxn rubik 39scube algorithm github python verified

The following guide breaks down the top GitHub repositories, implementation strategies, and verified Python-based solvers for large cubes. 1. The Leading NxNxN Solver: rubiks-cube-NxNxN-solver

The cube is flattened into a 2D grid representing the six faces (Up, Down, Left, Right, Front, Back). Each face holds an

Visit GitHub today, clone one of the verified repositories, and try solving an 8x8 or 10x10. When your terminal prints "Solved successfully" after a few minutes of computation, you'll understand the power of verified NxNxN algorithms. The cubesolve project emphasizes : the model, the

: High-performance solvers often require pre-generated lookup tables to handle the massive state-space of larger cubes.

cube scales into tracking thousands of individual moving pieces.

. These are known as . A verified repository must include robust algorithmic handlers for these states: 1. OLL Parity (Orientation Parity) This link or copies made by others cannot be deleted

: This is one of the most prominent repositories, capable of solving any size cube (tested up to 17x17x17). It relies on reducing larger cubes to a 3x3x3 state and requires the Kociemba solver for final resolution. trincaog/magiccube

puzzle and solved using classical algorithms like CFOP (Fridrich) or Kociemba’s Two-Phase method. 2. Managing Parity Errors

: Two composite edges are swapped, or two corners are swapped.

: Many solvers utilize numpy for state manipulation or tkinter for GUI-based visualization. dwalton76/rubiks-cube-NxNxN-solver - GitHub

optimal solutions, Herbert Kociemba’s "Two-Phase Algorithm" is the industry standard that many solvers use for the final reduction phase. Algorithms Work in Python