network profile
| bio | website | ryba4.com |
|---|---|---|
| location | Novosibirsk, Russia | |
| age | ||
| visits | member for | 2 years, 6 months |
| seen | Feb 14 at 14:51 | |
| stats | profile views | 60 |
My BitBucket profile, my CV at careers. I'm a Python & Javascript programmer, know some DBs well. Know some Linux stuff.
I speak Russian, Italian, Spanish and English fluently.
I'm fond of cycling, MTB orienteering, travelling.
|
May 6 |
awarded | Popular Question |
|
Apr 9 |
awarded | Popular Question |
|
Mar 16 |
awarded | Popular Question |
|
Jan 14 |
awarded | Notable Question |
|
Jan 9 |
awarded | Yearling |
|
Jan 7 |
awarded | Good Question |
|
May 4 |
awarded | Popular Question |
|
Apr 27 |
revised |
What components does OpenLayers.Strategy.BBOX require for compilation? added 208 characters in body |
|
Apr 26 |
comment |
What components does OpenLayers.Strategy.BBOX require for compilation? I added Filter/Spatial, and it worked. I also found out that Format/GeoJSON was necessary. |
|
Apr 26 |
accepted | What components does OpenLayers.Strategy.BBOX require for compilation? |
|
Apr 23 |
asked | What components does OpenLayers.Strategy.BBOX require for compilation? |
|
Mar 21 |
accepted | How can I use R-Tree to find points within a distance in Spatialite? |
|
Mar 21 |
comment |
How can I use R-Tree to find points within a distance in Spatialite? Can you, please, write an example, how to find all pairs of points close one to another? I can use it too. I'd prefer PostGIS over SpatiaLite after learning the latter more. After installing Python library for spatialite, compiling GEOS, P-something, and seeing things working differently in Python than in spatialite shell, I want SpatiaLite go to hell. |
|
Mar 21 |
revised |
How can I use R-Tree to find points within a distance in Spatialite? added 105 characters in body |
|
Mar 21 |
asked | How can I use R-Tree to find points within a distance in Spatialite? |
|
Mar 16 |
accepted | Need an explanation on a network simplification algorithm |
|
Mar 16 |
comment |
Need an explanation on a network simplification algorithm That's clear now, thanks a lot! |
|
Mar 16 |
comment |
Need an explanation on a network simplification algorithm So, {1, 8, 9} are replaced because they are duplicates in {A, 8, 9; 1, G, 9; 1, 8, F}, or just because they are the rest of the subgraph? (after removing the internal nodes) |
|
Mar 16 |
comment |
How to simplify a routable network? Did you find any solution to this problem? I'm doing a similar task just manually, with a custom script: gis.stackexchange.com/questions/21823/… |
|
Mar 16 |
accepted | Are there newer routing algorithms (than Dijkstra, A*) in GIS databases? |
