🚧 Create an invisible perimeter around an element and respond when its breached.
-
Updated
Apr 30, 2018 - JavaScript
🚧 Create an invisible perimeter around an element and respond when its breached.
Is your AWS perimeter secure? Use Powerpipe and Steampipe to check your AWS accounts for public resources, resources shared with untrusted accounts, insecure network configurations and more.
Complete Reverse and Solver for PerimeterX (v6.7.9)
All perimeter-x files deobfuscated (atleast from the versions i could find)
Free WordPress Plugin: Right triangle calculator finds missing triangle measurements. It calculates side lengths, angles, perimeter, area, altitude-to-hypotenuse, inradius, and circumradius. www.calculator.io/right-triangle-calculator/
Scrape Linked In Users via Burp/Browser - Current as of 03/13/2023
Implementation of two phase field approaches for the surface reconstruction problem. One based of the Modica-Mortola theorem and the other based on Ambrosio-Tortorelli | Master Thesis
There exists no equation for the perimeter of an ellipse (excluding infinite series). This project uses gradient descent to find an approximate equation.
A program that can calculate the area and perimeter of plane shapes (Ex- Square, Rectangle, Parallelogram, Trapezoid, Circle, Ellipse, Sector, Triangle.)
File processing
The GUI version made from JAVA of the python calculator Ultra Cal
Few programs in RPN/FOCAL (HP41) for ellipse perimeter calculation and isoperimeter points calculation in the area (0-pi/2). Some calculations are made by infinite series or convergence series (AGM and MAGM). Some calculations are made with modified cycloids or modified conics. The concept of cosinus elliptique is introduced. One program in pyth…
Subdomain lookup tool using https://subdomainfinder.c99.nl/
A powerful web tool for calculating phisical and mechanical properties of standard geometry profiles
Use a Cree Zigbee radio to create an alert light
A program that calculates the value of the perimeter of 3 squares.
Given an array consisting of n distinct points[p1[x1, y1] ... pn[xn, yn]]. Find the closest pair of points using a Divide-and-Conquer Algorithm with asymptotic complexity of O(N log N)
Add a description, image, and links to the perimeter topic page so that developers can more easily learn about it.
To associate your repository with the perimeter topic, visit your repo's landing page and select "manage topics."