turf-buffer - Buffers a point, linestring, or polygon Feature/FeatureCollection to a given radius

  •        110

Calculates a buffer for input features for a given radius. Units supported are miles, kilometers, and degrees.Requires nodejs.

https://github.com/Turfjs/turf-buffer

Dependencies:

geojson-normalize : 0.0.0
jsts : ^0.15.0
turf-combine : ^1.0.2
turf-featurecollection : ^1.0.1
turf-polygon : ^1.0.3

Tags
Implementation
License
Platform

   




Related Projects

turf - A modular geospatial engine written in JavaScript

  •    Javascript

Turf is a JavaScript library for spatial analysis. It includes traditional spatial operations, helper functions for creating GeoJSON data, and data classification and statistics tools. Turf can be added to your website as a client-side plugin, or you can run Turf server-side with Node.js (see below).Download the minified file, and include it in a script tag. This will expose a global variable named turf.

geojson-google-maps - A simple utility to convert GeoJSON objects to Google Maps vector objects (Marker, Polyline, Polygon)

  •    Javascript

Google Maps now has proper support for GeoJSON, so you should probably use that instead. GeoJSON is used to create Google Maps API v3 vectors (Marker, Polyline, Polygon) from GeoJSON objects (Point, LineString, Polygon, MultiPoint, MultiLineString, MultiPolygon, Feature, GeometryCollection, FeatureCollection). Specifically, I'm translating some GeoJSON types to arrays of Google Maps vectors as there aren't really Google Maps equivalents of MultiPoint, MultiLineString, etc.

turf - Configurable C++ platform adapter

  •    C++

It then implements those things using POSIX, Win32, Mach, Linux, Boost, C++11 and possibly other platform APIs. You configure Turf to use the API you want. Turf is used by Junction, a library of concurrent data structures in C++.

BinExp - Linux Binary Exploitation

  •    C

I am quite passionate about exploiting binary files. First time when I came across Buffer Overflow(a simple technique of exploitation) then I was not able to implement the same with the same copy of code on my system. The reason for that was there was no consolidated document that would guide me thoroughly to write a perfect exploit payload for the program in case of system changes. Also there are very few descriptive blogs/tutorials that had helped me exploiting a given binary. I have come up with consolidation of Modern exploitation techniques (in the form of tutorial) that will allow you to understand exploitation from scratch. Lecture 1.

bl - Buffer List: collect buffers and access with a standard readable Buffer interface, streamable too!

  •    Javascript

A Node.js Buffer list collector, reader and streamer thingy.The original buffers are kept intact and copies are only done as necessary. Any reads that require the use of a single original buffer will return a slice of that buffer only (which references the same memory as the original buffer). Reads that span buffers perform concatenation as required and return the results transparently.


geobuf - A compact binary encoding for geographic data.

  •    Javascript

Geobuf is a compact binary encoding for geographic data.Think of this as an attempt to design a simple, modern Shapefile successor that works seamlessly with GeoJSON. Unlike Mapbox Vector Tiles, it aims for lossless compression of datasets — without tiling, projecting coordinates, flattening geometries or stripping properties.

buffer - The buffer module from node.js, for the browser.

  •    Javascript

With browserify, simply require('buffer') or use the Buffer global and you will get this module.The goal is to provide an API that is 100% identical to node's Buffer API. Read the official docs for the full list of properties, instance methods, and class methods that are supported.

proxymachine - A simple TCP routing proxy built on EventMachine that lets you configure the routing logic in Ruby

  •    Ruby

ProxyMachine is a simple content aware (layer 7) TCP routing proxy built on EventMachine that lets you configure the routing logic in Ruby. The idea here is simple. For each client connection, start receiving data chunks and placing them into a buffer. Each time a new chunk arrives, send the buffer to a user specified block. The block's job is to parse the buffer to determine where the connection should be proxied. If the buffer contains enough data to make a determination, the block returns the address and port of the correct backend server. If not, it can choose to do nothing and wait for more data to arrive, close the connection, or close the connection after sending custom data. Once the block returns an address, a connection to the backend is made, the buffer is replayed to the backend, and the client and backend connections are hooked up to form a transparent proxy. This bidirectional proxy continues to exist until either the client or backend close the connection.

TPCircularBuffer - A simple, fast circular buffer implementation

  •    C

A simple C implementation for a circular (ring) buffer. Thread-safe with a single producer and a single consumer, using OSAtomic.h primitives, and avoids any need for buffer wrapping logic by using a virtual memory map technique to place a virtual copy of the buffer straight after the end of the real buffer. Initialisation and cleanup: TPCircularBufferInit and TPCircularBufferCleanup to allocate and free resources.

MaskedOcclusionCulling - Example code for the research paper "Masked Software Occlusion Culling"; implements an efficient alternative to the hierarchical depth buffer algorithm

  •    C++

This code accompanies the research paper "Masked Software Occlusion Culling", and implements an efficient alternative to the hierarchical depth buffer algorithm. Our algorithm decouples depth values and coverage, and operates directly on the hierarchical depth buffer. It lets us efficiently parallelize both coverage computations and hierarchical depth buffer updates. Added the ability to merge 2 depth buffers, this allows both an alterative method for parallelizing buffer creation and a way to reduce silhouette bleed when input data cannot be roughly sorted from front to back, for example rendering large terrain patches with foreground occluders in an open world game engine.

picohttpparser - tiny HTTP parser written in C (used in HTTP::Parser::XS et al.)

  •    C

PicoHTTPParser is a tiny, primitive, fast HTTP request/response parser. Unlike most parsers, it is stateless and does not allocate memory by itself. All it does is accept pointer to buffer and the output structure, and setups the pointers in the latter to point at the necessary portions of the buffer.

point-in-polygon - determine if a point is inside a polygon

  •    Javascript

Determine if a point is inside of a polygon.This module casts a ray from the inquiry point and counts intersections, based on this algorithm.

junction - Concurrent data structures in C++

  •    C++

CMake and Turf are required. See the blog post New Concurrent Hash Maps for C++ for more information. Junction uses the Simplified BSD License. You can use the source code freely in any project, including commercial applications, as long as you give credit by publishing the contents of the LICENSE file in your documentation somewhere.

org-download - Drag and drop images to Emacs org-mode

  •    Emacs

This extension facilitates moving images from point A to point B. Point B (the target) is an Emacs org-mode buffer where the inline link will be inserted. Several customization options will determine where exactly on the file system the file will be stored.

hasha - Hashing made simple. Get the hash of a buffer/string/stream/file.

  •    Javascript

Hashing made simple. Get the hash of a buffer/string/stream/file.Convenience wrapper around the core crypto Hash class with simpler API and better defaults.

committia.vim - A Vim plugin for more pleasant editing on commit messages

  •    Vim

When you type git commit, Vim starts and opens a commit buffer. This plugin improves the commit buffer. committia.vim splits the buffer into 3 windows; edit window, status window and diff window. You no longer need to repeat scroll and back to the former position in order to see a long commit diff. If the width of Vim window is too narrow (160 characters by default), committia.vim falls back to single column mode, which has 2 windows; edit window and diff window.

vim-buftabline - Forget Vim tabs – now you can have buffer tabs

  •    Vim

If you don’t know anything about buffers, the minimum you have to know is that a buffer in Vim essentially means a file, and if you set hidden, Vim can keep files open without necessarily displaying them on screen. You can then use the :bnext and :bprev commands to change which buffer is being displayed in the current window, and :ls to look at the list of buffers. For the full story, read :help windows.txt.

vim-buffergator - Vim plugin to list, select and switch between buffers.

  •    Vim

Use gb (or <M-b>) and gB (or <M-S-b>) to flip through the most-recently used buffer stack without opening the buffer listing "drawer". Use <Leader><LEFT>, <Leader><UP>, <Leader><RIGHT>, <Leader><DOWN> to split a new window left, up, right, or down, respectively, and edit the previous MRU buffer there.

Generic Buffer

  •    C

General line based buffer with backlog written in quot;Cquot;. It supports multiple input and a single output. I/O modules: TCP/IP, UDP/IP, Unix sockets, File/Pipe. It supports backlog writing (and resume) so a failsafe transport-buffer can be build.