|
|
| Colorado Interactive Maps and Demographic Data |
|
Dynamic Maps Information Appendix Data Links - Data Sources |
Drawing KML MapsWhen I first started this site, it was actually quite difficult to make decent looking maps. Since Google now provides KML and XML processing of files, the ability is quite simple and easy for anyone to do. I feel like I do not need to put up full details on how to make a map anymore, so I have removed most of the information on how to assemble a map within a webpage. If you which to learn more about how to do it, I would suggest first looking at the The Google Map Blog. Also, the javascript used on this website to overlay a KML file is provided here in case anyone is interested. My KML Format for each DistrictOn each district webpage, there is an option to download the KML file of that district. Each KML has a standard format, and the boundary data is standardized. I would not suggest editing in any way. The portions before that are something that should be edited, with and example of the rows available below. <Folder> The Folder data is only seen on Google Earth, or if loaded directly into Google Maps at maps.google.com. The Placemark data is more important, and a description of all of the options I added are listed below.
There are further options which were not added to these files, but these will do ninety percent of what people require for displaying a district map. KML is cached by Google, so changes do not instantly when you refresh the webpage. If you want instant feedback, Google Earth is the best option, or just renaming the file. Polygon SearchesPolygon searches are covered in detail in a variety of other sites, but here is a brief explanation on how it is completed. If you want detailed specifics, see the links at the end of this section.
To find a whether or not a single district contains the data point we are looking for, you need to test districts in some manner. You can sequentially search all of the districts, or do an optimization protocol beforehand. Since we want to make the process fast, a point optimization is used to rank which district is likely the correct one.
Determining whether a point is inside of a polygon: Additional Problems
Issues If for some reason you wish to view the old version, that is still available and located here. |